From 4574f1115b9ed230f64d74ac90796dbd0c629051 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Thu, 14 Apr 2022 14:15:46 +0800 Subject: [PATCH 1/4] feat: add new lc problems --- .../2200-2299/2235.Add Two Integers/README.md | 71 ++++++++++++++++ .../2235.Add Two Integers/README_EN.md | 61 ++++++++++++++ .../README.md | 77 ++++++++++++++++++ .../README_EN.md | 67 +++++++++++++++ .../images/graph3drawio-1.png | Bin 0 -> 9334 bytes .../images/graph3drawio.png | Bin 0 -> 9426 bytes solution/README.md | 27 ++++-- solution/README_EN.md | 27 ++++-- solution/summary.md | 28 ++++--- solution/summary_en.md | 2 + 10 files changed, 331 insertions(+), 29 deletions(-) create mode 100644 solution/2200-2299/2235.Add Two Integers/README.md create mode 100644 solution/2200-2299/2235.Add Two Integers/README_EN.md create mode 100644 solution/2200-2299/2236.Root Equals Sum of Children/README.md create mode 100644 solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md create mode 100644 solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio-1.png create mode 100644 solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio.png diff --git a/solution/2200-2299/2235.Add Two Integers/README.md b/solution/2200-2299/2235.Add Two Integers/README.md new file mode 100644 index 0000000000000..4ff5ee091fc18 --- /dev/null +++ b/solution/2200-2299/2235.Add Two Integers/README.md @@ -0,0 +1,71 @@ +# [2235. 两整数相加](https://leetcode-cn.com/problems/add-two-integers) + +[English Version](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md) + +## 题目描述 + + + +给你两个整数 num1 和 num2，返回这两个整数的和。 +

 

+ +

示例 1：

+ +
+输入：num1 = 12, num2 = 5
+输出：17
+解释：num1 是 12，num2 是 5 ，它们的和是 12 + 5 = 17 ，因此返回 17 。
+
+ +

示例 2：

+ +
+输入：num1 = -10, num2 = 4
+输出：-6
+解释：num1 + num2 = -6 ，因此返回 -6 。
+
+ +

 

+ +

提示：

+ + + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **TypeScript** + +```ts + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2200-2299/2235.Add Two Integers/README_EN.md b/solution/2200-2299/2235.Add Two Integers/README_EN.md new file mode 100644 index 0000000000000..dea4008045ee4 --- /dev/null +++ b/solution/2200-2299/2235.Add Two Integers/README_EN.md @@ -0,0 +1,61 @@ +# [2235. Add Two Integers](https://leetcode.com/problems/add-two-integers) + +[中文文档](/solution/2200-2299/2235.Add%20Two%20Integers/README.md) + +## Description + +Given two integers num1 and num2, return the sum of the two integers. +

 

+

Example 1:

+ +
+Input: num1 = 12, num2 = 5
+Output: 17
+Explanation: num1 is 12, num2 is 5, and their sum is 12 + 5 = 17, so 17 is returned.
+
+ +

Example 2:

+ +
+Input: num1 = -10, num2 = 4
+Output: -6
+Explanation: num1 + num2 = -6, so -6 is returned.
+
+ +

 

+

Constraints:

+ + + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **TypeScript** + +```ts + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README.md b/solution/2200-2299/2236.Root Equals Sum of Children/README.md new file mode 100644 index 0000000000000..f86c3799e4c31 --- /dev/null +++ b/solution/2200-2299/2236.Root Equals Sum of Children/README.md @@ -0,0 +1,77 @@ +# [2236. 判断根结点是否等于子结点之和](https://leetcode-cn.com/problems/root-equals-sum-of-children) + +[English Version](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md) + +## 题目描述 + + + +

给你一个 二叉树 的根结点 root，该二叉树由恰好 3 个结点组成：根结点、左子结点和右子结点。

+ +

如果根结点值等于两个子结点值之和，返回 true ，否则返回 false 。

+ +

 

+ +

示例 1：

+ +
+输入：root = [10,4,6]
+输出：true
+解释：根结点、左子结点和右子结点的值分别是 10 、4 和 6 。
+由于 10 等于 4 + 6 ，因此返回 true 。
+
+ +

示例 2：

+ +
+输入：root = [5,3,1]
+输出：false
+解释：根结点、左子结点和右子结点的值分别是 5 、3 和 1 。
+由于 5 不等于 3 + 1 ，因此返回 false 。
+
+ +

 

+ +

提示：

+ + + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **TypeScript** + +```ts + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md new file mode 100644 index 0000000000000..b006288835ef2 --- /dev/null +++ b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md @@ -0,0 +1,67 @@ +# [2236. Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children) + +[中文文档](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md) + +## Description + +

You are given the root of a binary tree that consists of exactly 3 nodes: the root, its left child, and its right child.

+ +

Return true if the value of the root is equal to the sum of the values of its two children, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: root = [10,4,6]
+Output: true
+Explanation: The values of the root, its left child, and its right child are 10, 4, and 6, respectively.
+10 is equal to 4 + 6, so we return true.
+
+ +

Example 2:

+ +
+Input: root = [5,3,1]
+Output: false
+Explanation: The values of the root, its left child, and its right child are 5, 3, and 1, respectively.
+5 is not equal to 3 + 1, so we return false.
+
+ +

 

+

Constraints:

+ + + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **TypeScript** + +```ts + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio-1.png b/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio-1.png new file mode 100644 index 0000000000000000000000000000000000000000..71b7df4f94dc25188ac14702584ecef6dab613de GIT binary patch literal 9334 zcmYjX2{@Ep*hUjW%2u{y9i+mTVGyzpV>e_c%M4j&VeBbe*%jlNtSPcr|C#Um{{Q-~Yp!|Eyyv{|F(DWz!U%LP(cO`Iyi6bNyL$YD4=L!3BKgu;5JeVlt2XvJWneIqvWN)MUzbS z!CT{94L!lz(F#aK86*naK5wXRX>25p&<156Pj5W9=;7VGNwi0_ultb*;0{_24my^R zS5ijFC@O#o3m116KhOWy4Q)1fe;1E`XJTWmV}`XcL?~+-lFjvO(Lq|CA^*-G5bsCv zBoY5@CZ{Nakdgnl!aszJ|MxBqAL!`@UWyP$>H=f_XEo5j=YMwc_6@L8*29}xx_g)) zu$q2&c|-7e+6ag)V6^|(+YFdWTJGOYkXCj$Zv~16+6*pd7NB4pj8XFTQt+oB{1o5_ zZ*ROmK?#Q?d4za~BeXD{Sbr0DBq&j|4asB*f-FZ4P^J*&ZL}5KjFl9$(WszMT!5J_ z+1<_#u1iu@*4Fk%D+bAH>w6o?W31eD{Ji}P(4+vIou=V+?_hItlOS6V09quXHPM`K z9qnRji#F6YRIo+a8X6dC`nniuy6ape`RVCcQVbP+6S6;_QoqCZ9vIDF2K(t)cPvQRt{z7 zp`&!wO^E;x(Zl#z`Vp+Lz7#ClO5P2nhcxmeEBd*D9!zaX+C(cGv#b6{ogg&H%GFhe zWDK`JSXu;`D=A?HADs|X({>O0xgYfIs@<$b&7(H8ePok@)4o==y&nHM8M|APiQPei4#X9W+f(8A*>*SwB1AhMpLP%Y^ zD=i&#bV5lO9Zkz%r*%hWGPmx?1~iVxj)UVh14LZokpTC3Zs;c_hC2y8kIu8u8^*^$ z{lpRk`j*Y1B_$CN5lk7_$Dhuns0au`drGfI@<8gEd#p|W%;l)xhJ9-#1qONqr4aA2&GmTdRH>RZycfVzH#K4XIsG zz)H^1czHwU zsYx6*(eJ+Is@?cJ>5+Fo3+Z9d68iHAcyhR&VE@yEdL~${KSMU7E0L%F%Rr8}nwn$i z&lT~jPpypWF|9mgh(3Z|(HXHKq(s&b3_tSCQt(dS-k7o9Xk3-~X*10otR&mK8D;eF z^3}$mZ!+4kr|uivzwmPAKnh3?)s4l!I?1U=&V-@+JUQmtK2ytJ!+*kX=}V${fkDaPngp&$UtUceS1)FflQ)*@f=GV)Vo`VWR5M_umf!t8V=YojKhtH9GO!?O|*85?R5oIkWPoLnr>>eNlM`xv zCK0Q8!N7qlrCjmdp%&tW!WapuiM3nIhA^GARxp^ri`jZj>C*OIui+Uck#bpXx){XW zM=agZ6Q6JX=#^YdGrjWMFW!%yLGT$rI^0oOuk0RP1>8T zK2x6q5(H4u9|z_)PTy;I_}Kjq1;%$s_-xZDVVvEw-Y`e(lB;to+)|5MSP$9yf^m0u zuQuLP>t`44wQ*0ujcLMURWo%Hxy3)+R`@m(wl%Qw4vv`MPdjbMK{a|lU$cOJAWDmY zD}RnC*F-~R(DbS88BU?4YqKpmK@X=H$76T&5mzEM0yE-r)s`Mmwi`8UAmeOz1(Y9~ z_xw!~( zsy26p)MdCNO}5JnhYt9Z$oUWa`lJxIj)I2{aC#e{KVKmWQ~THDE2iqd9-zv zHzj0W9r-z^?L|C_6X`rtaRvEk+x2}sv8 zv1uJ;`_iuv^~$-O!5F?6D=f5WeeGsfo2q(S&?8f7(h1>%caR^I!gnFXvJ#LnF_plz zk~1*#(UX!k=l8zE=96C2AD2?UE2K0zC5h>_>VN(2#291B&q2#EdZVwrk&c0r`0ThN z5K`$NAUt!kxuxx{&t_b#Y{nk@V#M+ZpQ6V0$08~gESX@GMY7zxSNmVix>+-`hcDpR za1&K7QQ;oBAw_a9->!M!cy3tzV+b2P)o9bFh(F`PRfFGq3vA`a>-9&6-(EHLu5NdT z>oXRcN%*%=s9KE;#BMNMb-WA~i-o*-D*;ncvFA!1%0j*|-{Nr~ zM_#h6)}gdza;7aP6e2(TQl}x;FHWOSgiUV#ZRvEkroi=Ku1mP-r)H0$9^c7R|Is6c z2>*TLux)mWoB6FKBk_b9UjxU_dNpcNLvYjkoMpAF-~`bwoeUXA9Kh6r^BX)Ok;>@` z#1p%?Y4qp^umEO1t=o}`Ofx=79gLW&mj-POs(j;>r>(z7x`JMNlhvyH;rfY z#?2+4RqQ*dI4wLE{-@=F1K0>OAOG;KY_T#;VVO#6|H=4zAd?+^l&vw=gu)zx#ok<_+gTL9x5$`5Q18)>Lg|GnpC zyj4Y-YZX27=6>{2Ubqvn<)>8;Q)aQkYzK<5T=HZZPBn7UNK#^}SD2A0r;$x{Q{&Oc zBc+cWSVoB3iWmJ>Z{~hrv(J6lg7}ooF8(r7aI}lyb17#wY|A(@=vcdMZ$06I*Oi>U z`xl#3%eZpf+*J!ULx+_x-CUUi{;rqbRPvQ`dEZyQ#nsv0U5r7X?8NCG+LQ~^SM8O^ zf{+i3oM|z!4eC|9G)d(HUUet`e0J3;Wt-J2@GlsEUsz<#vcmh0`d(eOlmdx0m|QLJYg-wy%g9*b_j9}lig?`6*Z-~pTAtG%Y#!$jHElHLNd zH~cPtG&x|*q^a7{?bY$23BpFcGY3iygK()Si7RTqt;qG{vTo14W3ujR6VF9z^=o5w zsLZ9mQlSFHCM5&7ru-sKlhh)Uhh9x(qq5AvDwqiFzpORn!Rk)AbAre2rGEz}b0KMD zcvv5g%mP8cLd<|qO2uO+SDG+YoBBvQHfDnJoghC(;>pf606kxpyQH{O zc?C#fg%U(U0pf{JYJ1%0<5>ci{q@rvKW6eDq5&e+fyhTU2CnmCy>)Kb05?qu9l|qT zY&ulIdM|GJm_-Ewf?(Gst)MWb#88qW@6rLulJ}(MLmhtW&jRQvZ56t?ohs;N(QyY1 z)M01zU?Q_5?nrm#Z4_koSaX(bjk~9^9c%^lak7olPK6euXPSbnWs9ns^h?mp!!#^O z7KgEAl^#P1P>r087LClO4>iXkBy)pBH%{ntMV2ukJqG^*><4qWv#wC??u+#jmHhT& zu^<2aQ&)A!mOIAOG{dPS6f;(Kbz$WgiAf=^>h(qQ$2!wX`x%AqqO+Cr0=A>(5#%fY>8f=}@9~PUG`>p|Gc@W_l-&nm z{?`Z2%eu@mV4=-VnRs7~b`}i%Dx%iHoD-p>60q__kl#WbGT!)4ty+e6#Y?o{t-X(Q z_a0v#GiTT>EzTV-Sg*$S#{@ob5#+^4@)PeM3qoP5r zQayI)cu;B;#|m22AR?xsOi(r0%=CcJxMHaooBBX zJB$d6!IWaC7#0-i+U3BtOu?(WU*BnuDCjt{hfOq)uKoNf^YSybq|@cs9tQC~M}L%} zna~%{CCR8^PqL(ec=N%^)6m+RE2YJuBT_doEWm=;s*qhyRi5dypYF7$$;B#0-{cQQ zoxTC6=!Ey#7U37TUQS2ud93In4w5p(;0Xg0T+;!0MX}>3g+_xolhPb6rJw42VW&TQ z=huZN8<#F&GJM4+G*bbDT{_aRs&p#nT8d`7lHxv)ZCmol@q$R+$xST=8Ss`SV8RJJ zoAI+`u_?eMdd~$-yJQ9Kltp`G^=L;Y&oiFnpLlv5q96u1p+7q-qW|Ps)LX>Bnl+QB zNcTOVO2fAx_&-#Vb>v~aHn{6+7as(?w_Vw>plUmR?n#YWVbUx+mOHH+qFa3p|Dm36nd8gg!;2u(X}OnuyJi&(^L%T6 zx-=Jp=OUUZXyvY(D59ZTM$J=HE&hD2^@Y?5y+;juvxUwP-)1x&Z(jSkAowd(#_ zhf7_T7iF zvIh-jKb7b9e;~ao55FokD;n|R!kLR!e--E5n)+~8Z1yasyOWJBw}10v=Y8h{i_ux_ z``Tk;*TR1l9y&i%3E~C=C4qqkN7rzk@PfG<j$UxG5}|B@suN_A z&#V+fjmJ>>y8^w7@0{~uTu*_{lzr;(!7}G758fh&csJq)BopZL8I^AUv%jU~nz7|E zwP4eC6f=CX%QEd|zxI~ZqX`&BibQT-?try?Uh?UpKAMRtwfg0Mz@q=Q@s?XqQ2Dzq3%`Bk74O)Xv>>kfMUHHxG34$eje`63bpZe-r5}gl5Pwx&-Gv&e- zIEz#Z$;|pEvOkvQH=%`lUqnbQNITHItCrxM`<$z(kLY^M`Ta~u>TMNFl7O^CCU?uA zK4CXWlPblS-h9l0b(3N9!nX%6-C$HBs!}&`OLUbV%VgFOPe&T!nX3Tg0j}f3`MN{+ zD%}hiHf-M)%T0L z$zUcd3qsaL)hScHz*lcFWZqeSN8>siSFEzgL|bZ-_A{GTZ$!*Q!q-6Xj{Q;!R@l>v zzXuTN3cADK_9=~ozr~&%Wo16cAbdAnjTc{EDJfAM;QulxZA^`iKI3)1ps}qdRqSCw zpQKo1+xGGZ9+D*SNRP*yxzdM=)hp)=-W8sM2w0HN)` z!YuoU`Ik6%_ddYB_Se}XMLE7s)jg#xJ4c}_3d2~c$U8>hQ z!5qt(3qS4v;x}+)5~raBedg3+_eyBg4{SNMTHj*!U8ryWJUe_N6#kVd>XlZHov8>z zuW%LE-Dpr3+Cj@Wi{k%o(WdU_VLrZ`FUV94@%x(emOdnr&MQ|I5d8QeTrYJtkmy2! z@o_AFXs8qb$ZmEjS_?9*k#CxJ#cyxZCDMZ{AYQe%jiQ+hdorZ@bJU{Xw;K6KM)dCr zM-_~rVH$w!#tE;@>;!qxD3a$`!w%I@hB^0V$@4L&fJ&gz?mqh{^N>Utr!5tbiey3M z3Y+Iz6)ihcB~y6|sH8U9)-lJo^0>1m{;>`fSM`UX^B%99R%5^_w{8>Vt)S>8$OH6& zKr`yrdi0}TZEf;yg(wCwkfUh*?Kn(ZguzJ|?$*s30y6&l*FjTN*~Z$Udp)VFsu{zD zhW$WcASH8@=*zRW3DpIxzGqg=Igfdw&xm$iqrHe%Dk zOpIA?4BwxgoN!aw_MG8P$)#~IOAYrv}21LqpTf#?_B&2={aFh<8Iu3M}dW-iX##*FfDEwhZ3D=i=j_(b6e%`8Ar)1 z#o1u(bQ#Ao;{5(no@_F|0u>n809>E^!=TttKpAz8b!h5F04X+@Jta}S(zA}2KHrwBu&Xl&T2nvxDyG1D2MS@1Jf{-)bvMz@WWNFG^MGXX z+&B|Q!{DjQJ67{unVSxuq}YZSXIXa$MMhbVpUXOj@LqqLDQEOqfKB7~tR2KGYANO{ zvBwxkS`9OVwB6Qc93OiQV;Gq-^AR|6w9&Hb?sNgdQWlc1loa3eg{LR7c zH_~F5woROcuMq;MpW_3TJ{wb(7a&2Y^LC$j!xp-eP2LPF#YK!konO8R`sUQWoJ!a_ z84FkX35NVkjP+b9D=Of*)9aAmK%H4Fagh}|0FGZwwl+ z_F?SIX?HwT6i80s&)Yf?SvAzafGNVHN$`hU@01Iuj(PKar#WN`2J*p4i9JD%O$e8+2~5QXZvv_8~8DCw42m1l?j-d}3f`61yd zAUPz8*aI+rA7m{&q2s+6m9Q9SriSo^t#t@hb9+sB=|REx@ea{Ax+{L4DF`^iV(6kFdu^=5-j2(PC|7& zTcvvEIo|^vR1#o8h1}6SLA5fyz88PCzrPXkW*O{GKD%1J0n(n%*_~ z-m*HN9kTM->DAdItVw>YUESM2H|YbC*yCki-#ppMU`@nVS=1c1$TTnam@MPu;&l4l ztwZC)GLd&mpFz9P(9yUKHIQMryN7ST)1x%qTzmc|$-O>W?>LFELhKH7FOse-G&7sT z%ht#0Vo&!ps$n+tX`4u>F5>xqIyE&l)#9m@^bD_`J$nJdV^H9ne0A8PVLH?`x9XdR zfy>h`YkWS`8;8q#jh-*i?Roxf3kaoh@F9YBjoKTivwhoWSTv`S!}3(!D)WH@x&3(5 z!3VkT2{_j+=|Z3hE60ho6RXCfRIrLO{uVNHMNIcbYG`TB1@*h*D3@?|4vki^v@L1% z-XsBK>;ro z-vASb|aYtQ|i3O%gou;BhD??3|;xq<6&Uh4SnV#PY)4Y?hS5{ zOq&zzY2$f%=zUrE-VFrvTgEG15c-iDh~rZ08IoyDl5RizJ%JF-&t40(2j$?+{35$H z4kxGfn-ZUulH+@grE+EXvJ`3k8Rf}L>L6Yg8%iwT%qpcwM*~$Zo$?)u-y|r%y_qC1 zF~0xTy)OclYD9dH)Ejrrp|5eh{sZpk%Gl+=OR*BBxz9XyY;taGwljfkDWB_Z%_Eyz zq&L#u$WPCUH9`!zjNG z#iiM{JtLl@FR{BpUACWiQ3Dw&ta3oenUz_Vih@icsN`|K(wEMaX5o0_Bj{tnUx9>lc}k^~309 z_zRWDngf96hG4@t3g`@s*TB*s8=$|2*YpeD>?rz%f@m3iwYWa0b_^@?fmunoK1WE}m&DWoll+>2Zy|f+2*7No)>l$xKusl2TFzjLqZBwtM<5$g&IeC_GaCmjR z(wdD?WcugoINO8YmP&Te+c#U!=!1V#VBx~&B!=;#?@Y`fV?VM{gbTk8ex`x*Kt^4{ z3ZE~eLzT8IPK51keq0$4mNhbic#6(t! z{?Q)2I2Q>od;6LBQ4rVt%IGU|oT7ZZ9B&9W54PW(&bp`m`-Ln`Zv;|i2~BZamH(c3 z*=HniAzp+%W$>7$+7+nP=ZVv#r@a&0;9U6_h*w(iwBxLhLkWEKg^XetOt1%T6RD>hfHI zE<(=VmvGK@;<=PVrIVWHTx&}$;e!=8&*z35RLKG+E9_ zxG;O|{uh?s&k6$A6Ry_(3WOsi=3=Gx4HcnECHfJ0kA8EqG(SQGfJ5Ys@_aOxDmXT* zhh8xK z;KKauCNKRKM^{UoS{i}d^uz*vgA%mBu{H(b^N@tbbStZdQK9USRiZ!?yJoY3yRm7);1I7<=|T%#58ej3xV)C9;g2q6N`Hl#rbevSf+M zF3BDu3Z2LI`#snBUFSO2nLpln=Y5~K-}`>v`?)`#`|~6k8E7$`<~~h9LBWL4)-a}^ zpyUGQ-4I%Eyka7J2)-!&jJ4D#Dh7C$DJZB@NN7uvSCF%tC!RtOq5kigAROjO@FNK# zGz8&rM;{+aoSUPIucMcrq&J=fE`j@A1e}|*8y@%X7&r_LzXFrF0+Tm|!vqnk{~QoV zNt86w`rq-6E_m<%3?e0Az<`K_n>UUS=m$;>Ou<1K1}-Diz!|t9EA#JZkgSX-xT5Og z5L;;7bdS^&p)5Mcvhx;03N|O2dF* zNf~*RtfU+g+%R!;cJy`oA7)OX!IK|v&A=!ZbLYU&|0tgL)Z5pw@V5Ppargi?EO;nf5P=4h`QNMo`)>culLyh?8l{CdG<9|{ zfE%m&;$?Kf<4-*Bb_Cx3Gv7vFs;)@?YXo6#jq^bIxo8@}q>cP#^<_NpCP64^Ke#Uv z2KVs5lf2|{#srs}E`o41jETFhBZw=2gjLn`@$rNENc;Gs{Jdo>)sa|zd8E3gtc)Is zXoU83Mq0zr1Qb%u$ifXJk5W_B1%K04)$tCLK{}ck<9#(uuA7)y>%&wv{NSo6qID1v zW=*(`_eQIFs%hf=uzs3mp6ccXo>m5~x@MN{uKqAhoHU+^9QW5CR)={xG& zbT^SRw(?U2=FO~~JaPVJF8a=9=5SRFe7d4=M8KJki5O*5tc|Db0o+JHETVzv%aIW zVW4Xe#t{5AM&8sy6L0!@Sr`XcscRBck<$A9*FA#eECN*#cx^v~DFTgAw=g&L(}%m= z#1S+IMoyYq-dK{phLNU>siB#lD^b6}^hct#EDdlZb5}Dg-USVl zchoj9BDn>7`e48VrL8q}jdA|I(yA6HjG>x`t_zWfRP|I3RyBd?yAmAHfp}wCQ@nI97GM0Cd^>EV;vQ+mql?jptkpcTK zwDCzUBUDu_^$cXK9kCu-(z+ICPk+3;KibgEoIt$pZ(^=zri1sk!aEzwxw^SoTbh`e zI=g|jp-I#-*L6ao{9G-}wWJ+k&M0JX02-`I%^)>X8Iq2hx3-%r0w-rK;|6yO4m5XC z55~&Cu`+mLFhomNSI5-XM_(UKlGlO3Of8)aHBB9jkzVR%vW_TOOEAQe-~^l^YT$!R zkw_~8nE-H2UCmP)<^w;OZY@n8tf4jzPCQA9>mDabjyUn^f3J>zmJ0a&U+F=h8y+_} zQ&8}2V>DDvgY4Jsm|hu}afcJWyYyCjYb!Hc_pZq-;^=?=)~MYW`#`xQEnGYIFz)=h zOQt3m^aEqj1Dn3v!=u{U1w{|rpe4Cz_u|r$WQEn6i0NXj_RNN`QlcZF9V}7cb$T=BTl1(#La~h2wcO#W&uekVhX>WJ9|TbAuSSYryf9iBuasK4 z7g#v@%*rH!)`_w$(p5!1WN$6KviY~pYtK&tJhGl?=fusw4_eoHUs?ZLlaX>k;SCK{ z4KkVn(*=3vE%SRZ=SJ_#!E53prTQ7POx)Uk_SQ?hzPw(!w|_23iGfoxv)*s1_xJ8< ziA}Bd@FOjjaHFJFSn~C__G#RvT$Jof|enCfOkO1)D zvEA+{6>o$}urEVJdJYY}^~I>pEVI*S&N8 z+i(w8#!d4~=mM9R+{L#-n+vJRlDavPHNJ_N%xH;w`LbSOzor8DgR)Q=%6MA?W_&C2jcLmv=AY^z&uXZM^F{Z)4pDb#j7P zyT2e@1~Tz|*#} zQ?Tz6H3pfq2$CiVN|tjy%gPlB=D2rn{mad9QCFYKuBlLV%I~UyiQhlzWQi^NN7X?p z_||4xZam5q^}eh^CVmNzCNcT1e#|1Y9LZ+(r8u_T(#>+Y=b!EQ`BkEuKs(ixkusD^ zy)|xZZMH3D@yA>TJp6F~#T&-wMNy~ddWqc^gcrK*Fg!O5IIBnn&6|~GszFaaIsVbX zg012-;g(M7Fl~gu6(<5B87LuD# zaIn9Sx>%B9zdc2JBbkGetoLevX;dLw$K&I(9#LU}4kd5I<)!z%S>j3lSF?pTYtf>so0b;^g>T$avB{i-iW{D@6qOBqHy7m$W+*$J$mmb!#sG2<(2QZ z!_Ku(u`o&^2d(G^1Hr{)#6a3qLm=m0kqbTi zT1@cICB-Ce{kI#WmC^E`Wg0tSgS#Tag+UMb%#eIPmWm<M0W+H2j$`Fv%Bw~?v)D#_FOR?wZ* z%9fQ*^w(!mwgI2;+bd5i-LrZ!XTL7D(eaH&q}l$$zfe@)Ya9;IOv#rdx@X{ck*Ifb zNm9)}!m=m?@k{*$kNYZ2JKqieW2{fA#nnml?UKsyP0_MS8K<`iD%!Lbj0318UR5XY z+aaKKPQJ`@w|$^S(-y1cwQ~QhIaxJr79)HQ+H$mKW2BB(xCE*PJ=+?8LvLRnyM%7^ zSsM&3Rz`Z7zY1%!d{Tsd`wwLhM}6o`3qV{S{H8KQJtpiG^F(CB>xCD-YyDQP!N5~K zOO1~Rwm@Tk>3FZi5o7yD1htfn$;n^h`j7@foa8oSRDt)K@;dsFwxHw;;vbt5;f1mz z-#h#Lw{QTn%5pB(dVMMF$GtH(%8#wSb(gK>lYsO14wS25ZO*E|c2jau4X*t6@a1I4 zW)nQ@_s`_t-?$UvnS%mFFTXceRv}k?R$R_vSm6lhx!CA=SX$WqvTQ4}S1H3_#MVUV zzTI?tz|YHzg}|MdJ=Jd+sv)1!7@bHQQuY!NzekFOG~;UuNp;9+wFhv(#b20wAt9er;eTRm^Rnql<7 z_ynr{LM;P(h^K^9!pO-Bn$9$sZl+v{T?||r5M;;h)&%K`R2U)JuBm#z$DJXaqppOfUF42Dbpf!hbo(L9H~AT1k%e6gU$v=_*FJ;C%g1a5BJ{yaKz3e+_g z{`x(Ln0$KyvD|=dd!aRnODXu3hmXk&BM8^&cjC{LFe8QjI@&bkd3V_rYi zISK{1xJ8*SUK#27+I#8=&8C;_Re(YHpJ`}lpyw^FiSY%KaiNjlhQ%kACaSRUv+xrA zg0_jT>l0OvOrKkueXOusJySf2)CGuXMfGiXL8^KGA%8fn*5{+&yCc!Nvb=aeoTxGu1LDNQ&@vT+5;^?Z%Lb4+&91-^rAX4< z|2Ks)?~mEe%G-fn~{1U5* zbWoAu=jB!ISXC|m9K5^Y_EvJkU{MS*pz!x_$Dc2L{u;=`UtS`>-_oDUBU<#d?9={~ zd5$;e19N9T8BJ<}wetE12O4(tGH$ZwUa(}ueg_}!Z2}u}>ionLP;z#*-?AHi z{}2FdV-*JES&~5!^q;FYEi+Or)ytdz4rzRPXI6F6KiWl|$O7UGksV2}yL)_}!{7J> zs)OBW2jk{Bfcv#;C55_TJ9b%OX1pWU(mLdNwB96$(J~Vissq0wewGMfx;Q=OntzTM zDlcE(U9X*~Smq{6LawcSsjUnqEft1%56`^_KZJ6v>O)uR`O%B}TMHM4WO>h>03xAr zEAFBfU&P_o9I4kn^b%OIG&Vs}ZGLS{m+a3ga{C1#CLTw*s8?}<(3)ObXtZbKfMLDo2XP<86aWaB#XB(rzCN^c{z~}{6A774%Ii~+6q8YNS}a^Vplb`oB4?0_95)vRsYiu zv;v3{)YB1v!`#N6WSxm{biC9CPX^;)t??{;=Fx3Tb8RtnJR5iVL(mRg$z0ojOpAYT zD2j7p1{sF(ticCKid6mv+03(%*zb}=p-qbl0gK>0NKNVZ=W(w9ON@k{=^*tp2A)PxdiL4h{=j+ACpUZ~qY%2VKsS_dEh)WkN3sb z3%R_lezRuND26U=C|8kusrQb+Dz`D6(R?BWVQ|UYf}G64n4Uvj1=Bv)+6cWyL0UUk zyb(GZMVCwW?(vj1{8}V74#{^Pb$lAZ{acP7Bc!{QD=w?s>hx3I5Ag>fgb`wxOw(Tn z{kZeTKN7H{FONVQJ|+>iHI*7;5fhR59;6c-3w@^X zowAr(slB)86ITH=gHr0F>A*&ePVdMw$Bn6BXda{GgE;sThGbsUu)>p2I2%L{G{A*7 zzi~}H>Khz1e4Bg3NQU|`j(WEo1stsdQv03Gra6OxI*$2*7(f)(Alb}nKsk#K;Is7- zHm~)vC9K*B@ep42D1gg-qL1$i3|{*qkuC-xOpoh+s~;Cw^KaV5o|rAft5d@TBH4w% zvV%g5Is@*POU;9JcZ?gupWAhZXD8$mRUzvHAYB)|F0a!m^7Q@%56ax<2I9p-`jWZ5 zfbT<5GxTilPDd^F<*fdSu{P+>NA|5u$t&xT4~qOF4i-6&RDM`MtX4%eT3M(7aJ*sU zl{ZqFv#xPJa1#jFOv4?!7zau2iwGIqJ+E-tPi0OZGJgq_OOuD9H=0B1?%7Q6U^F#; z@2!hB1gxLQ?6}Vw#n1YEs-bpms=;FR6V&dEA^eA}(PjE&M5^-fesKf~Z$u>ImB+Zj z>C>lihx=QUuUG6%5{0;eB!4)~ek=^xsNb+k<+i!gYN&iv{3jH$66=y-ijnAfW?7|{ z%FB7h8hXY0mG+Y(ly?WjbGp&01u=?_cgfJeKzkhi(!}vy3#}t94+|y+Eaj?eIBd;# z4p(8dc5?yGnr97p{phI%Sr52B7DCx$l%R4RqL&9pUyL{;3g(NMJ&FBLf((PE;AZRZ z`n1z;AMOm=V5!B(jMP80yukaQ8Wh5iMaWU<7M1qT|G>@)u+mWNUye7?3zEg8zfEIQ z1QoRXx<3Hb45u3@BWlzyOuNZSqJ6s>C-*X?+k)$WK*A9oU@D4%tW7uBq`to1SMD)h zQN)rSqsKzqpqx!*H>BjWil6zqWI!qwuOZZY#`B4$s` zv$&D&B12_vem#OY)MpGM8)2YnY@TiBz6F^`XvL-~2?6{ve%My-B6(&vRQGYnEOh6i z4WZ}oU}ua;@&Birl|g=tS=^xCuIIlY_K>)Rz;Sn+p^MV{bXqZIv-wX7=V&!e%3yp7 zg>h2oPQM%+$ZXI4yv8?Q(A`qe{sua}Q4PcYA)?V_?alt9p=l2&25#6|wS+g3RzKk#Q-b15YMSMW-T{HeZ`v44hx|>x4k|>UxE_c^g5;KT#&SoVvb&K$IB?Wn6QG! zg~2-58?D>0AyCzG-=Wwe51VQr_o)YK#_etHzMKAdkj)fnmCji46pNuQt$8pZFSbAB zH>mU`GhZ4T_sVTVvnO7S+E$Z7+U|!ftQ*LUE{mb+mI)SHdhm`orjdSA&yCNfV$^}@ zv)1$HLxKEc-`&5I5IF{MsBZx{*S4JQwZjw-li$4nnjm3DrF2GF|0?^pH;>C77p|1g z!T5e3|JhvZ;vtNh#!v8;vQp--C433((}tgi?J00bSUNOKv4+N*2%ovLTlz5CjWuB* zR6(f60cdk}re-9x^=r>^whntcltmX>X(3g`cFD$?+$Ka2%gDK-TTCkA%{H(coCYdh zuuCF{Lxq1}=eZuat%}Pxy*;VQZKP+lJG$Q?2vOJ9Hp*;&eZlYgCDvaD=0ZI(Zo?Xv zS-j*+_dJ4l34?c0CfQePzSYt{i;&w66cuw(e&1rLUi29F@KImXUw-G1 z5mxObkj6xX$t7r|F&d=1k5^nN3fr@SrZ;{%-`)2zfwB2VI|Ckwxo(?RZ@R?~vQn}` zpdeXQ;R%J$P0PvloC!(%R6&64a3e97sAMmtWgeL8!RxNs*LvF>?0q4q*RP$=t|FFi zKYKYq)-RB~sl(2eZNDb`2?BL%K9}+SKV_~;g87=ytO{zQZUHx0N9;MSMg@DYY7d8s z3vo?8(PYjR@ir@Xt+?mxqs~+N8q{c7YO>5sCeDX`wSK8EBXIhru*_jqa{Zr;2AZDC zOZx=szxPPP7)?^$@0F)DEXw7IcSPQ5vL~sW-+5kEru_oiamyK(t0BQ0?M|$!0)kJz zu7Z@*U@nu+fSh377w-mr$)=yfL-S4)6vK!UD$*GvqYwW-+8dl!f=7tTo)xAvlcvD4 z>=Vy?;R))ME`zV9G7tpw2RQ0q>udKMltNF9djX_DEq?9SylyI0w_IBAb!SkS$JU5)yo3Ps;}lN~1e_h8AE9aNe`Tk>Xh zC>{MAK_;K-{CYz6j*u&N+X~u_lj$-2wT*>JAsi?A+=^W;heYaC|CQpJEFInR(3sHH zp{S^vrC0j*MlMBS2=2|mb=^%~f%I#|H+Q~mZ}&-g+_lu1?ZGP3B8OhEC5y|IB{{1Z z?_Ak@^0Y!sjW@Bp#!Ba)DB{>^MCt^NB1Y@|Tm%aM{+a%b0QN^-ZY^{xWbt*!Zhdkl zLHK9V%MapyzSLH04*BJMf&byu+?a-0hy-$G8$jyqwA}$*C}TFJjx7vqd92J{KV*tM zwJEwd77LO$M|Dr}Q0kw_`<4f+eDxK)MiYB|KhT zm-j;#M1FX9_z>V{`**Wwav!wLjsGsdN>}@77>2eAwRG1ng}>_DKQ^;PO26@ZJ7*3N zt)GkIIq6*S-c;C6v{KzTwKt=oed2&Juss>iyDBBsq}M*ScYO3me8@3_ah{HKjZX71 zYm^9UnbCvj+fFVhnW3q88H{?Jpxz>oE8tgE^Phs9HK z{TvBkfHq1*%Vc4f=FAP9vs6MYEuNTfC(0?9ezyTZljtq(UEB*jwL2Vjp67?eD;os> zg&5k>P=)`*>4oWdj*C+{2E!qBJkn0FnjaThh`(bmZ;Z|{kh;k9^zZd;rA78|dh0z7 zd9h_3qeSA90DpHY4w@bx!>(1+S-(8adZqvCLL8lThPJGxy8Sc&I>iDDMWwzGK||Qqr5H%AqMdb>)2%|uk`3`JG(RXgBbND{ zNt`^wdGjNJCPcU_nQ;NfIB-#Rot`p-2(Q!e0r1(kz1U}#^R(iPPUQ!Orvj%9OXUr^ zOy5@Cfp#R^Fx-h`;nHZuz1;*&iGR{O5YQzqQvUAnS_8W{CdUVZ5i5&5K;Jq0_u^kZ zX%C@d`FXkb4Z4DKXF3ZRHzo7-Gbfy7A-RnW)JoGKn@UUpSHwHj-IUl~#x>~H4Z5h^ z-juu*#-M=A7155XeW4$!O)^Q{Z$Yh33AJ;{#O z@;pnaijawsJ)!U+9^r;M>cj{Y|pj`u-AkD0y<&{B@% zZQW4KGlGOi7yYAB+0lAsbs7ckRQPpZl(K;jyg2H?&EE-PoMWI zWz+r~imjmS>0-#UK93Q; zJ90UZ#hYZ35ZMoT8`hkKftM8|QMvwbN!IS8BhZ#` z*s^_HjpU4>2L8;Rp(5TRbVIq$mjUt`yb?Pa{;#k}FG>es1x-CKKLaQ0-9Aw@#Q+7Y z_Faw@JR`<;_Uzd-2iv<=qX!Ub6&Yeap-@|>hNO1x4Up`tYPgd1?M*dQsPK~M@-_?6 z6xjyEJVGHx2;A_rC{uCh*pf{tXG5aER;KrM7e0W<+X-<%$TRO;5hu5OCr-w3f2>1a zb$*|#EfB-jljJlHSRvb2wnb^Ai?c0TLPuy{KF+vHqj(-{V&PjODf98-K)4`^`7{i6n8lIqqd&Z;ze4Qld>*{Nr(p51 z@=?loAD@PKjjLx#B|>O%&K* zzT^}HB<*UiFS1dA)q$J#f*h=j3AC{$U~hXj7;N@j25A8_xXF7DSt$i(FHqVn6V~*%HL5{?had W22_eju{cnG4+d?ZQK9A#{l5THFCT0G literal 0 HcmV?d00001 diff --git a/solution/README.md b/solution/README.md index 663a9f83845d4..5428690968c73 100644 --- a/solution/README.md +++ b/solution/README.md @@ -87,7 +87,7 @@ | [0074](https://leetcode-cn.com/problems/search-a-2d-matrix) | [搜索二维矩阵](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | | | [0075](https://leetcode-cn.com/problems/sort-colors) | [颜色分类](/solution/0000-0099/0075.Sort%20Colors/README.md) | `数组`,`双指针`,`排序` | 中等 | | | [0076](https://leetcode-cn.com/problems/minimum-window-substring) | [最小覆盖子串](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | | -| [0077](https://leetcode-cn.com/problems/combinations) | [组合](/solution/0000-0099/0077.Combinations/README.md) | `数组`,`回溯` | 中等 | | +| [0077](https://leetcode-cn.com/problems/combinations) | [组合](/solution/0000-0099/0077.Combinations/README.md) | `回溯` | 中等 | | | [0078](https://leetcode-cn.com/problems/subsets) | [子集](/solution/0000-0099/0078.Subsets/README.md) | `位运算`,`数组`,`回溯` | 中等 | | | [0079](https://leetcode-cn.com/problems/word-search) | [单词搜索](/solution/0000-0099/0079.Word%20Search/README.md) | `数组`,`回溯`,`矩阵` | 中等 | | | [0080](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii) | [删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md) | `数组`,`双指针` | 中等 | | @@ -228,6 +228,7 @@ | [0215](https://leetcode-cn.com/problems/kth-largest-element-in-an-array) | [数组中的第K个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md) | `数组`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | | | [0216](https://leetcode-cn.com/problems/combination-sum-iii) | [组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md) | `数组`,`回溯` | 中等 | | | [0217](https://leetcode-cn.com/problems/contains-duplicate) | [存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md) | `数组`,`哈希表`,`排序` | 简单 | | +| [0218](https://leetcode-cn.com/problems/the-skyline-problem) | [天际线问题](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md) | `树状数组`,`线段树`,`数组`,`分治`,`有序集合`,`扫描线`,`堆（优先队列）` | 困难 | | | [0219](https://leetcode-cn.com/problems/contains-duplicate-ii) | [存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md) | `数组`,`哈希表`,`滑动窗口` | 简单 | | | [0220](https://leetcode-cn.com/problems/contains-duplicate-iii) | [存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md) | `数组`,`桶排序`,`有序集合`,`排序`,`滑动窗口` | 中等 | | | [0221](https://leetcode-cn.com/problems/maximal-square) | [最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | | @@ -591,6 +592,7 @@ | [0579](https://leetcode-cn.com/problems/find-cumulative-salary-of-an-employee) | [查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md) | `数据库` | 困难 | 🔒 | | [0580](https://leetcode-cn.com/problems/count-student-number-in-departments) | [统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md) | `数据库` | 中等 | 🔒 | | [0581](https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray) | [最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md) | `栈`,`贪心`,`数组`,`双指针`,`排序`,`单调栈` | 中等 | | +| [0582](https://leetcode-cn.com/problems/kill-process) | [杀掉进程](/solution/0500-0599/0582.Kill%20Process/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 中等 | 🔒 | | [0583](https://leetcode-cn.com/problems/delete-operation-for-two-strings) | [两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md) | `字符串`,`动态规划` | 中等 | | | [0584](https://leetcode-cn.com/problems/find-customer-referee) | [寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md) | `数据库` | 简单 | | | [0585](https://leetcode-cn.com/problems/investments-in-2016) | [2016年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md) | `数据库` | 中等 | 🔒 | @@ -686,6 +688,7 @@ | [0675](https://leetcode-cn.com/problems/cut-off-trees-for-golf-event) | [为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | | | [0676](https://leetcode-cn.com/problems/implement-magic-dictionary) | [实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | | | [0677](https://leetcode-cn.com/problems/map-sum-pairs) | [键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | | +| [0678](https://leetcode-cn.com/problems/valid-parenthesis-string) | [有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md) | `栈`,`贪心`,`字符串`,`动态规划` | 中等 | | | [0679](https://leetcode-cn.com/problems/24-game) | [24 点游戏](/solution/0600-0699/0679.24%20Game/README.md) | `数组`,`数学`,`回溯` | 困难 | | | [0680](https://leetcode-cn.com/problems/valid-palindrome-ii) | [验证回文字符串 Ⅱ](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md) | `贪心`,`双指针`,`字符串` | 简单 | | | [0681](https://leetcode-cn.com/problems/next-closest-time) | [最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md) | `字符串`,`枚举` | 中等 | 🔒 | @@ -920,7 +923,6 @@ | [0910](https://leetcode-cn.com/problems/smallest-range-ii) | [最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | | | [0911](https://leetcode-cn.com/problems/online-election) | [在线选举](/solution/0900-0999/0911.Online%20Election/README.md) | `设计`,`数组`,`哈希表`,`二分查找` | 中等 | | | [0912](https://leetcode-cn.com/problems/sort-an-array) | [排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md) | `数组`,`分治`,`桶排序`,`计数排序`,`基数排序`,`排序`,`堆（优先队列）`,`归并排序` | 中等 | | -| [0913](https://leetcode-cn.com/problems/cat-and-mouse) | [猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) | `广度优先搜索`,`图`,`记忆化搜索`,`数学`,`动态规划`,`博弈` | 困难 | | | [0914](https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards) | [卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 简单 | | | [0915](https://leetcode-cn.com/problems/partition-array-into-disjoint-intervals) | [分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) | `数组` | 中等 | | | [0916](https://leetcode-cn.com/problems/word-subsets) | [单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) | `数组`,`哈希表`,`字符串` | 中等 | | @@ -996,7 +998,6 @@ | [0986](https://leetcode-cn.com/problems/interval-list-intersections) | [区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) | `数组`,`双指针` | 中等 | | | [0987](https://leetcode-cn.com/problems/vertical-order-traversal-of-a-binary-tree) | [二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 困难 | | | [0988](https://leetcode-cn.com/problems/smallest-string-starting-from-leaf) | [从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | | -| [0989](https://leetcode-cn.com/problems/add-to-array-form-of-integer) | [数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) | `数组`,`数学` | 简单 | | | [0990](https://leetcode-cn.com/problems/satisfiability-of-equality-equations) | [等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) | `并查集`,`图`,`数组`,`字符串` | 中等 | | | [0991](https://leetcode-cn.com/problems/broken-calculator) | [坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) | `贪心`,`数学` | 中等 | | | [0992](https://leetcode-cn.com/problems/subarrays-with-k-different-integers) | [K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) | `数组`,`哈希表`,`计数`,`滑动窗口` | 困难 | | @@ -1386,6 +1387,7 @@ | [1376](https://leetcode-cn.com/problems/time-needed-to-inform-all-employees) | [通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) | `树`,`深度优先搜索`,`广度优先搜索` | 中等 | | | [1377](https://leetcode-cn.com/problems/frog-position-after-t-seconds) | [T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图` | 困难 | | | [1378](https://leetcode-cn.com/problems/replace-employee-id-with-the-unique-identifier) | [使用唯一标识码替换员工ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md) | `数据库` | 简单 | 🔒 | +| [1379](https://leetcode-cn.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree) | [找出克隆二叉树中的相同节点](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | | [1380](https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix) | [矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) | `数组`,`矩阵` | 简单 | | | [1381](https://leetcode-cn.com/problems/design-a-stack-with-increment-operation) | [设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) | `栈`,`设计`,`数组` | 中等 | | | [1382](https://leetcode-cn.com/problems/balance-a-binary-search-tree) | [将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) | `贪心`,`树`,`深度优先搜索`,`二叉搜索树`,`分治`,`二叉树` | 中等 | | @@ -1407,6 +1409,7 @@ | [1398](https://leetcode-cn.com/problems/customers-who-bought-products-a-and-b-but-not-c) | [购买了产品 A 和产品 B 却没有购买产品 C 的顾客](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md) | `数据库` | 中等 | 🔒 | | [1399](https://leetcode-cn.com/problems/count-largest-group) | [统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md) | `哈希表`,`数学` | 简单 | | | [1400](https://leetcode-cn.com/problems/construct-k-palindrome-strings) | [构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) | `贪心`,`哈希表`,`字符串`,`计数` | 中等 | | +| [1401](https://leetcode-cn.com/problems/circle-and-rectangle-overlapping) | [圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) | `几何`,`数学` | 中等 | | | [1402](https://leetcode-cn.com/problems/reducing-dishes) | [做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 困难 | | | [1403](https://leetcode-cn.com/problems/minimum-subsequence-in-non-increasing-order) | [非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) | `贪心`,`数组`,`排序` | 简单 | | | [1404](https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one) | [将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) | `位运算`,`字符串` | 中等 | | @@ -1703,6 +1706,7 @@ | [1695](https://leetcode-cn.com/problems/maximum-erasure-value) | [删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | | | [1696](https://leetcode-cn.com/problems/jump-game-vi) | [跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) | `队列`,`数组`,`动态规划`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 中等 | | | [1697](https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths) | [检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) | `并查集`,`图`,`数组`,`排序` | 困难 | | +| [1698](https://leetcode-cn.com/problems/number-of-distinct-substrings-in-a-string) | [字符串的不同子字符串个数](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md) | `字典树`,`字符串`,`后缀数组`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | | [1699](https://leetcode-cn.com/problems/number-of-calls-between-two-persons) | [两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md) | `数据库` | 中等 | 🔒 | | [1700](https://leetcode-cn.com/problems/number-of-students-unable-to-eat-lunch) | [无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md) | `栈`,`队列`,`数组`,`模拟` | 简单 | | | [1701](https://leetcode-cn.com/problems/average-waiting-time) | [平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md) | `数组`,`模拟` | 中等 | | @@ -1739,11 +1743,14 @@ | [1732](https://leetcode-cn.com/problems/find-the-highest-altitude) | [找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) | `数组`,`前缀和` | 简单 | | | [1733](https://leetcode-cn.com/problems/minimum-number-of-people-to-teach) | [需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) | `贪心`,`数组` | 中等 | | | [1734](https://leetcode-cn.com/problems/decode-xored-permutation) | [解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) | `位运算`,`数组` | 中等 | | +| [1735](https://leetcode-cn.com/problems/count-ways-to-make-array-with-product) | [生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) | `数组`,`数学`,`动态规划` | 困难 | | +| [1736](https://leetcode-cn.com/problems/latest-time-by-replacing-hidden-digits) | [替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) | `字符串` | 简单 | | | [1737](https://leetcode-cn.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions) | [满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) | `哈希表`,`字符串`,`计数`,`前缀和` | 中等 | | | [1738](https://leetcode-cn.com/problems/find-kth-largest-xor-coordinate-value) | [找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) | `位运算`,`数组`,`分治`,`矩阵`,`前缀和`,`快速选择`,`堆（优先队列）` | 中等 | | | [1739](https://leetcode-cn.com/problems/building-boxes) | [放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) | `贪心`,`数学`,`二分查找` | 困难 | | | [1740](https://leetcode-cn.com/problems/find-distance-in-a-binary-tree) | [找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | | [1741](https://leetcode-cn.com/problems/find-total-time-spent-by-each-employee) | [查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md) | `数据库` | 简单 | | +| [1742](https://leetcode-cn.com/problems/maximum-number-of-balls-in-a-box) | [盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) | `哈希表`,`数学`,`计数` | 简单 | | | [1743](https://leetcode-cn.com/problems/restore-the-array-from-adjacent-pairs) | [从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) | `数组`,`哈希表` | 中等 | | | [1744](https://leetcode-cn.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day) | [你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) | `数组`,`前缀和` | 中等 | | | [1745](https://leetcode-cn.com/problems/palindrome-partitioning-iv) | [回文串分割 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) | `字符串`,`动态规划` | 困难 | | @@ -1752,6 +1759,7 @@ | [1748](https://leetcode-cn.com/problems/sum-of-unique-elements) | [唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) | `数组`,`哈希表`,`计数` | 简单 | | | [1749](https://leetcode-cn.com/problems/maximum-absolute-sum-of-any-subarray) | [任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) | `数组`,`动态规划` | 中等 | | | [1750](https://leetcode-cn.com/problems/minimum-length-of-string-after-deleting-similar-ends) | [删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) | `双指针`,`字符串` | 中等 | | +| [1751](https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended-ii) | [最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) | `数组`,`二分查找`,`动态规划` | 困难 | | | [1752](https://leetcode-cn.com/problems/check-if-array-is-sorted-and-rotated) | [检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) | `数组` | 简单 | | | [1753](https://leetcode-cn.com/problems/maximum-score-from-removing-stones) | [移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) | `贪心`,`数学`,`堆（优先队列）` | 中等 | | | [1754](https://leetcode-cn.com/problems/largest-merge-of-two-strings) | [构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) | `贪心`,`双指针`,`字符串` | 中等 | | @@ -2127,6 +2135,7 @@ | [2124](https://leetcode-cn.com/problems/check-if-all-as-appears-before-all-bs) | [检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) | `字符串` | 简单 | | | [2125](https://leetcode-cn.com/problems/number-of-laser-beams-in-a-bank) | [银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) | `数组`,`数学`,`字符串`,`矩阵` | 中等 | | | [2126](https://leetcode-cn.com/problems/destroying-asteroids) | [摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) | `贪心`,`数组`,`排序` | 中等 | | +| [2127](https://leetcode-cn.com/problems/maximum-employees-to-be-invited-to-a-meeting) | [参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) | `深度优先搜索`,`图`,`拓扑排序` | 困难 | | | [2128](https://leetcode-cn.com/problems/remove-all-ones-with-row-and-column-flips) | [通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md) | `位运算`,`数组`,`数学`,`矩阵` | 中等 | 🔒 | | [2129](https://leetcode-cn.com/problems/capitalize-the-title) | [将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) | `字符串` | 简单 | | | [2130](https://leetcode-cn.com/problems/maximum-twin-sum-of-a-linked-list) | [链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) | `栈`,`链表`,`双指针` | 中等 | | @@ -2229,11 +2238,13 @@ | [2227](https://leetcode-cn.com/problems/encrypt-and-decrypt-strings) | [加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md) | `设计`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | | | [2228](https://leetcode-cn.com/problems/users-with-two-purchases-within-seven-days) | [Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md) | `数据库` | 中等 | 🔒 | | [2229](https://leetcode-cn.com/problems/check-if-an-array-is-consecutive) | [Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md) | `数组` | 简单 | 🔒 | -| [2230](https://leetcode-cn.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | | 简单 | 🔒 | -| [2231](https://leetcode-cn.com/problems/largest-number-after-digit-swaps-by-parity) | [按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) | | 简单 | | -| [2232](https://leetcode-cn.com/problems/minimize-result-by-adding-parentheses-to-expression) | [向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) | | 中等 | | -| [2233](https://leetcode-cn.com/problems/maximum-product-after-k-increments) | [K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) | | 中等 | | -| [2234](https://leetcode-cn.com/problems/maximum-total-beauty-of-the-gardens) | [花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) | | 困难 | | +| [2230](https://leetcode-cn.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | `数据库` | 简单 | 🔒 | +| [2231](https://leetcode-cn.com/problems/largest-number-after-digit-swaps-by-parity) | [按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) | `排序`,`堆（优先队列）` | 简单 | | +| [2232](https://leetcode-cn.com/problems/minimize-result-by-adding-parentheses-to-expression) | [向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) | `字符串`,`枚举` | 中等 | | +| [2233](https://leetcode-cn.com/problems/maximum-product-after-k-increments) | [K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | | +| [2234](https://leetcode-cn.com/problems/maximum-total-beauty-of-the-gardens) | [花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 困难 | | +| [2235](https://leetcode-cn.com/problems/add-two-integers) | [两整数相加](/solution/2200-2299/2235.Add%20Two%20Integers/README.md) | `数学` | 简单 | | +| [2236](https://leetcode-cn.com/problems/root-equals-sum-of-children) | [判断根结点是否等于子结点之和](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md) | `树`,`二叉树` | 简单 | | ## 版权 diff --git a/solution/README_EN.md b/solution/README_EN.md index 6c2664c7accd9..0ea148c7a9a72 100644 --- a/solution/README_EN.md +++ b/solution/README_EN.md @@ -85,7 +85,7 @@ Press Control+F(or Command+F on the | [0074](https://leetcode.com/problems/search-a-2d-matrix) | [Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | | | [0075](https://leetcode.com/problems/sort-colors) | [Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | | [0076](https://leetcode.com/problems/minimum-window-substring) | [Minimum Window Substring](/solution/0000-0099/0076.Minimum%20Window%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | | -| [0077](https://leetcode.com/problems/combinations) | [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md) | `Array`,`Backtracking` | Medium | | +| [0077](https://leetcode.com/problems/combinations) | [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md) | `Backtracking` | Medium | | | [0078](https://leetcode.com/problems/subsets) | [Subsets](/solution/0000-0099/0078.Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | | | [0079](https://leetcode.com/problems/word-search) | [Word Search](/solution/0000-0099/0079.Word%20Search/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | | | [0080](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | | @@ -226,6 +226,7 @@ Press Control+F(or Command+F on the | [0215](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Kth Largest Element in an Array](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | | | [0216](https://leetcode.com/problems/combination-sum-iii) | [Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md) | `Array`,`Backtracking` | Medium | | | [0217](https://leetcode.com/problems/contains-duplicate) | [Contains Duplicate](/solution/0200-0299/0217.Contains%20Duplicate/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | | +| [0218](https://leetcode.com/problems/the-skyline-problem) | [The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Divide and Conquer`,`Ordered Set`,`Line Sweep`,`Heap (Priority Queue)` | Hard | | | [0219](https://leetcode.com/problems/contains-duplicate-ii) | [Contains Duplicate II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Easy | | | [0220](https://leetcode.com/problems/contains-duplicate-iii) | [Contains Duplicate III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README_EN.md) | `Array`,`Bucket Sort`,`Ordered Set`,`Sorting`,`Sliding Window` | Medium | | | [0221](https://leetcode.com/problems/maximal-square) | [Maximal Square](/solution/0200-0299/0221.Maximal%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | | @@ -589,6 +590,7 @@ Press Control+F(or Command+F on the | [0579](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Find Cumulative Salary of an Employee](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README_EN.md) | `Database` | Hard | 🔒 | | [0580](https://leetcode.com/problems/count-student-number-in-departments) | [Count Student Number in Departments](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README_EN.md) | `Database` | Medium | 🔒 | | [0581](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Shortest Unsorted Continuous Subarray](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Sorting`,`Monotonic Stack` | Medium | | +| [0582](https://leetcode.com/problems/kill-process) | [Kill Process](/solution/0500-0599/0582.Kill%20Process/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | 🔒 | | [0583](https://leetcode.com/problems/delete-operation-for-two-strings) | [Delete Operation for Two Strings](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Medium | | | [0584](https://leetcode.com/problems/find-customer-referee) | [Find Customer Referee](/solution/0500-0599/0584.Find%20Customer%20Referee/README_EN.md) | `Database` | Easy | | | [0585](https://leetcode.com/problems/investments-in-2016) | [Investments in 2016](/solution/0500-0599/0585.Investments%20in%202016/README_EN.md) | `Database` | Medium | 🔒 | @@ -684,6 +686,7 @@ Press Control+F(or Command+F on the | [0675](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Cut Off Trees for Golf Event](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | | | [0676](https://leetcode.com/problems/implement-magic-dictionary) | [Implement Magic Dictionary](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | | | [0677](https://leetcode.com/problems/map-sum-pairs) | [Map Sum Pairs](/solution/0600-0699/0677.Map%20Sum%20Pairs/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | | +| [0678](https://leetcode.com/problems/valid-parenthesis-string) | [Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | | | [0679](https://leetcode.com/problems/24-game) | [24 Game](/solution/0600-0699/0679.24%20Game/README_EN.md) | `Array`,`Math`,`Backtracking` | Hard | | | [0680](https://leetcode.com/problems/valid-palindrome-ii) | [Valid Palindrome II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | | | [0681](https://leetcode.com/problems/next-closest-time) | [Next Closest Time](/solution/0600-0699/0681.Next%20Closest%20Time/README_EN.md) | `String`,`Enumeration` | Medium | 🔒 | @@ -918,7 +921,6 @@ Press Control+F(or Command+F on the | [0910](https://leetcode.com/problems/smallest-range-ii) | [Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | | | [0911](https://leetcode.com/problems/online-election) | [Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | | | [0912](https://leetcode.com/problems/sort-an-array) | [Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Bucket Sort`,`Counting Sort`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)`,`Merge Sort` | Medium | | -| [0913](https://leetcode.com/problems/cat-and-mouse) | [Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) | `Breadth-First Search`,`Graph`,`Memoization`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | | | [0914](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | | | [0915](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) | `Array` | Medium | | | [0916](https://leetcode.com/problems/word-subsets) | [Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | | @@ -994,7 +996,6 @@ Press Control+F(or Command+F on the | [0986](https://leetcode.com/problems/interval-list-intersections) | [Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) | `Array`,`Two Pointers` | Medium | | | [0987](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree) | [Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Hard | | | [0988](https://leetcode.com/problems/smallest-string-starting-from-leaf) | [Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | | -| [0989](https://leetcode.com/problems/add-to-array-form-of-integer) | [Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) | `Array`,`Math` | Easy | | | [0990](https://leetcode.com/problems/satisfiability-of-equality-equations) | [Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) | `Union Find`,`Graph`,`Array`,`String` | Medium | | | [0991](https://leetcode.com/problems/broken-calculator) | [Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) | `Greedy`,`Math` | Medium | | | [0992](https://leetcode.com/problems/subarrays-with-k-different-integers) | [Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sliding Window` | Hard | | @@ -1384,6 +1385,7 @@ Press Control+F(or Command+F on the | [1376](https://leetcode.com/problems/time-needed-to-inform-all-employees) | [Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Medium | | | [1377](https://leetcode.com/problems/frog-position-after-t-seconds) | [Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Hard | | | [1378](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier) | [Replace Employee ID With The Unique Identifier](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README_EN.md) | `Database` | Easy | 🔒 | +| [1379](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree) | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | | [1380](https://leetcode.com/problems/lucky-numbers-in-a-matrix) | [Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | | | [1381](https://leetcode.com/problems/design-a-stack-with-increment-operation) | [Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) | `Stack`,`Design`,`Array` | Medium | | | [1382](https://leetcode.com/problems/balance-a-binary-search-tree) | [Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md) | `Greedy`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Divide and Conquer`,`Binary Tree` | Medium | | @@ -1405,6 +1407,7 @@ Press Control+F(or Command+F on the | [1398](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c) | [Customers Who Bought Products A and B but Not C](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README_EN.md) | `Database` | Medium | 🔒 | | [1399](https://leetcode.com/problems/count-largest-group) | [Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) | `Hash Table`,`Math` | Easy | | | [1400](https://leetcode.com/problems/construct-k-palindrome-strings) | [Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting` | Medium | | +| [1401](https://leetcode.com/problems/circle-and-rectangle-overlapping) | [Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) | `Geometry`,`Math` | Medium | | | [1402](https://leetcode.com/problems/reducing-dishes) | [Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Hard | | | [1403](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order) | [Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | | | [1404](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one) | [Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md) | `Bit Manipulation`,`String` | Medium | | @@ -1701,6 +1704,7 @@ Press Control+F(or Command+F on the | [1695](https://leetcode.com/problems/maximum-erasure-value) | [Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | | | [1696](https://leetcode.com/problems/jump-game-vi) | [Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | | | [1697](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths) | [Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md) | `Union Find`,`Graph`,`Array`,`Sorting` | Hard | | +| [1698](https://leetcode.com/problems/number-of-distinct-substrings-in-a-string) | [Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README_EN.md) | `Trie`,`String`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | | [1699](https://leetcode.com/problems/number-of-calls-between-two-persons) | [Number of Calls Between Two Persons](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README_EN.md) | `Database` | Medium | 🔒 | | [1700](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch) | [Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md) | `Stack`,`Queue`,`Array`,`Simulation` | Easy | | | [1701](https://leetcode.com/problems/average-waiting-time) | [Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) | `Array`,`Simulation` | Medium | | @@ -1737,11 +1741,14 @@ Press Control+F(or Command+F on the | [1732](https://leetcode.com/problems/find-the-highest-altitude) | [Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) | `Array`,`Prefix Sum` | Easy | | | [1733](https://leetcode.com/problems/minimum-number-of-people-to-teach) | [Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) | `Greedy`,`Array` | Medium | | | [1734](https://leetcode.com/problems/decode-xored-permutation) | [Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | | +| [1735](https://leetcode.com/problems/count-ways-to-make-array-with-product) | [Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Hard | | +| [1736](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits) | [Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) | `String` | Easy | | | [1737](https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions) | [Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md) | `Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | | | [1738](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value) | [Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md) | `Bit Manipulation`,`Array`,`Divide and Conquer`,`Matrix`,`Prefix Sum`,`Quickselect`,`Heap (Priority Queue)` | Medium | | | [1739](https://leetcode.com/problems/building-boxes) | [Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) | `Greedy`,`Math`,`Binary Search` | Hard | | | [1740](https://leetcode.com/problems/find-distance-in-a-binary-tree) | [Find Distance in a Binary Tree](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | | [1741](https://leetcode.com/problems/find-total-time-spent-by-each-employee) | [Find Total Time Spent by Each Employee](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README_EN.md) | `Database` | Easy | | +| [1742](https://leetcode.com/problems/maximum-number-of-balls-in-a-box) | [Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md) | `Hash Table`,`Math`,`Counting` | Easy | | | [1743](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs) | [Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) | `Array`,`Hash Table` | Medium | | | [1744](https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day) | [Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md) | `Array`,`Prefix Sum` | Medium | | | [1745](https://leetcode.com/problems/palindrome-partitioning-iv) | [Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) | `String`,`Dynamic Programming` | Hard | | @@ -1750,6 +1757,7 @@ Press Control+F(or Command+F on the | [1748](https://leetcode.com/problems/sum-of-unique-elements) | [Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | | | [1749](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray) | [Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | | [1750](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends) | [Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md) | `Two Pointers`,`String` | Medium | | +| [1751](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii) | [Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Hard | | | [1752](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated) | [Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) | `Array` | Easy | | | [1753](https://leetcode.com/problems/maximum-score-from-removing-stones) | [Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) | `Greedy`,`Math`,`Heap (Priority Queue)` | Medium | | | [1754](https://leetcode.com/problems/largest-merge-of-two-strings) | [Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | | @@ -2125,6 +2133,7 @@ Press Control+F(or Command+F on the | [2124](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs) | [Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) | `String` | Easy | | | [2125](https://leetcode.com/problems/number-of-laser-beams-in-a-bank) | [Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) | `Array`,`Math`,`String`,`Matrix` | Medium | | | [2126](https://leetcode.com/problems/destroying-asteroids) | [Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | | +| [2127](https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting) | [Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort` | Hard | | | [2128](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips) | [Remove All Ones With Row and Column Flips](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Medium | 🔒 | | [2129](https://leetcode.com/problems/capitalize-the-title) | [Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) | `String` | Easy | | | [2130](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list) | [Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Two Pointers` | Medium | | @@ -2227,11 +2236,13 @@ Press Control+F(or Command+F on the | [2227](https://leetcode.com/problems/encrypt-and-decrypt-strings) | [Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | | | [2228](https://leetcode.com/problems/users-with-two-purchases-within-seven-days) | [Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README_EN.md) | `Database` | Medium | 🔒 | | [2229](https://leetcode.com/problems/check-if-an-array-is-consecutive) | [Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README_EN.md) | `Array` | Easy | 🔒 | -| [2230](https://leetcode.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | | Easy | 🔒 | -| [2231](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity) | [Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) | | Easy | | -| [2232](https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression) | [Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) | | Medium | | -| [2233](https://leetcode.com/problems/maximum-product-after-k-increments) | [Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) | | Medium | | -| [2234](https://leetcode.com/problems/maximum-total-beauty-of-the-gardens) | [Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) | | Hard | | +| [2230](https://leetcode.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 | +| [2231](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity) | [Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) | `Sorting`,`Heap (Priority Queue)` | Easy | | +| [2232](https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression) | [Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) | `String`,`Enumeration` | Medium | | +| [2233](https://leetcode.com/problems/maximum-product-after-k-increments) | [Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | | +| [2234](https://leetcode.com/problems/maximum-total-beauty-of-the-gardens) | [Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | | +| [2235](https://leetcode.com/problems/add-two-integers) | [Add Two Integers](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md) | `Math` | Easy | | +| [2236](https://leetcode.com/problems/root-equals-sum-of-children) | [Root Equals Sum of Children](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md) | `Tree`,`Binary Tree` | Easy | | ## Copyright diff --git a/solution/summary.md b/solution/summary.md index 9ddfe01a9cb94..5ee1ab581c365 100644 --- a/solution/summary.md +++ b/solution/summary.md @@ -221,7 +221,7 @@ - [0215.数组中的第K个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md) - [0216.组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md) - [0217.存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md) - - [0218.The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md) + - [0218.天际线问题](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md) - [0219.存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md) - [0220.存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md) - [0221.最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md) @@ -591,7 +591,7 @@ - [0579.查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md) - [0580.统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md) - [0581.最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md) - - [0582.Kill Process](/solution/0500-0599/0582.Kill%20Process/README.md) + - [0582.杀掉进程](/solution/0500-0599/0582.Kill%20Process/README.md) - [0583.两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md) - [0584.寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md) - [0585.2016年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md) @@ -689,7 +689,7 @@ - [0675.为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md) - [0676.实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md) - [0677.键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md) - - [0678.Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md) + - [0678.有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md) - [0679.24 点游戏](/solution/0600-0699/0679.24%20Game/README.md) - [0680.验证回文字符串 Ⅱ](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md) - [0681.最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md) @@ -930,7 +930,7 @@ - [0910.最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) - [0911.在线选举](/solution/0900-0999/0911.Online%20Election/README.md) - [0912.排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md) - - [0913.猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) + - [0913.Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) - [0914.卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) - [0915.分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) - [0916.单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) @@ -1006,7 +1006,7 @@ - [0986.区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) - [0987.二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) - [0988.从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) - - [0989.数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) + - [0989.Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) - [0990.等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) - [0991.坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) - [0992.K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) @@ -1404,7 +1404,7 @@ - [1376.通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) - [1377.T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) - [1378.使用唯一标识码替换员工ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md) - - [1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md) + - [1379.找出克隆二叉树中的相同节点](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md) - [1380.矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) - [1381.设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) - [1382.将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) @@ -1428,7 +1428,7 @@ - 1400-1499 - [1400.构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) - - [1401.Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) + - [1401.圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) - [1402.做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) - [1403.非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) - [1404.将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) @@ -1729,7 +1729,7 @@ - [1695.删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) - [1696.跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) - [1697.检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) - - [1698.Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md) + - [1698.字符串的不同子字符串个数](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md) - [1699.两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md) - 1700-1799 @@ -1768,14 +1768,14 @@ - [1732.找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) - [1733.需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) - [1734.解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) - - [1735.Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) - - [1736.Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) + - [1735.生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) + - [1736.替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) - [1737.满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) - [1738.找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) - [1739.放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) - [1740.找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md) - [1741.查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md) - - [1742.Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) + - [1742.盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) - [1743.从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) - [1744.你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) - [1745.回文串分割 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) @@ -1784,7 +1784,7 @@ - [1748.唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) - [1749.任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) - [1750.删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) - - [1751.Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) + - [1751.最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) - [1752.检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) - [1753.移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) - [1754.构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) @@ -2168,7 +2168,7 @@ - [2124.检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) - [2125.银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) - [2126.摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) - - [2127.Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) + - [2127.参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) - [2128.通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md) - [2129.将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) - [2130.链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) @@ -2278,3 +2278,5 @@ - [2232.向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) - [2233.K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) - [2234.花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) + - [2235.两整数相加](/solution/2200-2299/2235.Add%20Two%20Integers/README.md) + - [2236.判断根结点是否等于子结点之和](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md) diff --git a/solution/summary_en.md b/solution/summary_en.md index 320ffb123c0a2..8de2635bfa7fc 100644 --- a/solution/summary_en.md +++ b/solution/summary_en.md @@ -2278,3 +2278,5 @@ - [2232.Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) - [2233.Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) - [2234.Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) + - [2235.Add Two Integers](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md) + - [2236.Root Equals Sum of Children](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md) From 7cf40e282dab49dc0d1cad72c9829f4f1cae72cc Mon Sep 17 00:00:00 2001 From: yanglbme Date: Thu, 14 Apr 2022 14:17:20 +0800 Subject: [PATCH 2/4] feat: preview build --- .github/workflows/preview.yml | 40 +++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 .github/workflows/preview.yml diff --git a/.github/workflows/preview.yml b/.github/workflows/preview.yml new file mode 100644 index 0000000000000..5ea8ccb9f024a --- /dev/null +++ b/.github/workflows/preview.yml @@ -0,0 +1,40 @@ +name: Preview Build + +on: + pull_request: + types: [opened, synchronize, reopened] + +jobs: + build-preview: + runs-on: ubuntu-latest + + steps: + - uses: actions/checkout@v2 + with: + ref: ${{ github.event.pull_request.head.sha }} + + - name: Set up node + uses: actions/setup-node@v2 + with: + node-version: "12" + check-latest: true + + - name: Build + run: | + npm install --global surge + - name: Upload surge service + id: deploy + run: | + export DEPLOY_DOMAIN=https://doocs-leetcode-preview-pr-${{ github.event.pull_request.number }}.surge.sh + npx surge --project ./ --domain $DEPLOY_DOMAIN --token ${{ secrets.SURGE_TOKEN }} + + - name: Upload status comment + uses: actions-cool/maintain-one-comment@v2 + with: + token: ${{ secrets.GITHUB_TOKEN }} + body: | + 🎊 PR Preview has been successfully built and deployed to https://doocs-leetcode-preview-pr-${{ steps.pr.outputs.id }}.surge.sh + + + body-include: '' + number: ${{ github.event.pull_request.number }} \ No newline at end of file From a294065f254735d989a676fa1a25439781990c50 Mon Sep 17 00:00:00 2001 From: Yang Libin Date: Thu, 14 Apr 2022 14:22:57 +0800 Subject: [PATCH 3/4] Delete preview.yml --- .github/workflows/preview.yml | 40 ----------------------------------- 1 file changed, 40 deletions(-) delete mode 100644 .github/workflows/preview.yml diff --git a/.github/workflows/preview.yml b/.github/workflows/preview.yml deleted file mode 100644 index 5ea8ccb9f024a..0000000000000 --- a/.github/workflows/preview.yml +++ /dev/null @@ -1,40 +0,0 @@ -name: Preview Build - -on: - pull_request: - types: [opened, synchronize, reopened] - -jobs: - build-preview: - runs-on: ubuntu-latest - - steps: - - uses: actions/checkout@v2 - with: - ref: ${{ github.event.pull_request.head.sha }} - - - name: Set up node - uses: actions/setup-node@v2 - with: - node-version: "12" - check-latest: true - - - name: Build - run: | - npm install --global surge - - name: Upload surge service - id: deploy - run: | - export DEPLOY_DOMAIN=https://doocs-leetcode-preview-pr-${{ github.event.pull_request.number }}.surge.sh - npx surge --project ./ --domain $DEPLOY_DOMAIN --token ${{ secrets.SURGE_TOKEN }} - - - name: Upload status comment - uses: actions-cool/maintain-one-comment@v2 - with: - token: ${{ secrets.GITHUB_TOKEN }} - body: | - 🎊 PR Preview has been successfully built and deployed to https://doocs-leetcode-preview-pr-${{ steps.pr.outputs.id }}.surge.sh - - - body-include: '' - number: ${{ github.event.pull_request.number }} \ No newline at end of file From c0553289d6aca415314076ae29cdad68ee521e03 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Thu, 14 Apr 2022 14:24:57 +0800 Subject: [PATCH 4/4] fix path --- solution/2200-2299/2236.Root Equals Sum of Children/README.md | 4 ++-- .../2200-2299/2236.Root Equals Sum of Children/README_EN.md | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README.md b/solution/2200-2299/2236.Root Equals Sum of Children/README.md index f86c3799e4c31..685370e05f664 100644 --- a/solution/2200-2299/2236.Root Equals Sum of Children/README.md +++ b/solution/2200-2299/2236.Root Equals Sum of Children/README.md @@ -13,7 +13,7 @@

 

示例 1：

- + 
 输入：root = [10,4,6]
 输出：true
@@ -22,7 +22,7 @@

示例 2：

- + 
 输入：root = [5,3,1]
 输出：false
diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md
index b006288835ef2..52ddbac0e752d 100644
--- a/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md	
+++ b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md	
@@ -10,7 +10,7 @@
 
 
 

 
Example 1:

-
+
 
 Input: root = [10,4,6]
 Output: true
@@ -19,7 +19,7 @@
 

 
 
Example 2:

-
+
 
 Input: root = [5,3,1]
 Output: false