From 988e86fd3ad30188de78ee861beaff662221574e Mon Sep 17 00:00:00 2001
From: professorxin <1252778220@qq.com>
Date: Tue, 17 Sep 2019 13:46:39 +0800
Subject: [PATCH 1/9] =?UTF-8?q?=E4=BF=AE=E6=AD=A3Leetcode=E9=A2=98?=
 =?UTF-8?q?=E8=A7=A3=E7=9A=84=E4=BD=8D=E8=BF=90=E7=AE=97=E5=9F=BA=E6=9C=AC?=
 =?UTF-8?q?=E5=8E=9F=E7=90=86=E9=83=A8=E5=88=86=E7=9A=84=E6=8F=8F=E8=BF=B0?=
 =?UTF-8?q?=E9=94=99=E8=AF=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 notes/Leetcode 题解 - 位运算.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/notes/Leetcode 题解 - 位运算.md b/notes/Leetcode 题解 - 位运算.md
index d4c659b7..a89999ad 100644
--- a/notes/Leetcode 题解 - 位运算.md	
+++ b/notes/Leetcode 题解 - 位运算.md	
@@ -47,9 +47,9 @@ x ^ x = 0       x & x = x       x | x = x
 
 要得到只有第 i 位为 1 的 mask，将 1 向左移动 i-1 位即可，1&lt;&lt;(i-1) 。例如 1&lt;&lt;4 得到只有第 5 位为 1 的 mask ：00010000。
 
-要得到 1 到 i 位为 1 的 mask，1&lt;&lt;(i+1)-1 即可，例如将 1&lt;&lt;(4+1)-1 = 00010000-1 = 00001111。
+要得到 1 到 i 位为 1 的 mask，(1&lt;&lt;i)-1 即可，例如将 (1&lt;&lt;4)-1 = 00010000-1 = 00001111。
 
-要得到 1 到 i 位为 0 的 mask，只需将 1 到 i 位为 1 的 mask 取反，即 \~(1&lt;&lt;(i+1)-1)。
+要得到 1 到 i 位为 0 的 mask，只需将 1 到 i 位为 1 的 mask 取反，即 \~((1&lt;&lt;i)-1)。
 
 **Java 中的位操作** 
 

From 69d34190627c037999bc37ecbbfae5a878fde7ef Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 01:13:12 +0800
Subject: [PATCH 2/9] auto commit

---
 docs/notes/Leetcode 题解 - 动态规划.md          |   6 ++++--
 .../ffd96b99-8009-487c-8e98-11c9d44ef14f.png    | Bin 0 -> 24454 bytes
 notes/Leetcode 题解 - 动态规划.md               |   3 +--
 .../ffd96b99-8009-487c-8e98-11c9d44ef14f.png    | Bin 0 -> 24454 bytes
 4 files changed, 5 insertions(+), 4 deletions(-)
 create mode 100644 docs/pics/ffd96b99-8009-487c-8e98-11c9d44ef14f.png
 create mode 100644 notes/pics/ffd96b99-8009-487c-8e98-11c9d44ef14f.png

diff --git a/docs/notes/Leetcode 题解 - 动态规划.md b/docs/notes/Leetcode 题解 - 动态规划.md
index 6cf5449b..c556ee0f 100644
--- a/docs/notes/Leetcode 题解 - 动态规划.md	
+++ b/docs/notes/Leetcode 题解 - 动态规划.md	
@@ -902,6 +902,9 @@ Explanation: there are four ways to make up the amount:
 
 ```java
 public int change(int amount, int[] coins) {
+    if (amount == 0 || coins == null || coins.length == 0) {
+        return 0;
+    }
     int[] dp = new int[amount + 1];
     dp[0] = 1;
     for (int coin : coins) {
@@ -999,8 +1002,7 @@ public int combinationSum4(int[] nums, int target) {
 
 题目描述：交易之后需要有一天的冷却时间。
 
-<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/83acbb02-872a-4178-b22a-c89c3cb60263.jpg" width="300px"> </div><br>
-
+<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/ffd96b99-8009-487c-8e98-11c9d44ef14f.png" width="300px"> </div><br>
 
 ```java
 public int maxProfit(int[] prices) {
diff --git a/docs/pics/ffd96b99-8009-487c-8e98-11c9d44ef14f.png b/docs/pics/ffd96b99-8009-487c-8e98-11c9d44ef14f.png
new file mode 100644
index 0000000000000000000000000000000000000000..b01c1ca0e8f921f79d13747e16a43ee6ff98a843
GIT binary patch
literal 24454
zcmd43Wl&sE(>0m|4?}PmoB;wPBsjr!a0%`XAtboFy9IZ5cXxMpm*7rthulM+=Y8wm
zTlM|_eoz!M=j`2EyL+wG1j>9BL3xY+_SLIbC}N_5a<5*!?gD<A5aEGO+HRh$fM2hz
z<wOKtm5vhb1Ao98@=Ni*dQ}mI{HO~D{EcKGs%rh}70&yYpVwk?6sNCVX%mPE@+&xK
z9jELoV~N#Wt^K{eo7BFSSj$LrE_?fyni28s$G4fFK~gemMj9qEuT0WRFH*0}%nhH~
z-I0`U6tZHou!;)bx1URFmFn1qDX<$Z1e4j${`#N^AR@70K?M*Yp8k5Gh!BcX84wc0
z2bMSp0`UoNhcZz3pkX*r`vDKWLG1}g6A=BK0mcAc;`+b;CA)z#?Y6C@I`i}WDJoTU
z^{BZr?V+JKy6uH3Lq;Yha#RwY=(96RJYwS5)>fVd*N0lryLW>tP4)(QdIH4UP83yD
zRp%Q$$c|SBG0lz_!aOdwqyz*6=bL?~cTW#>wp0S5mB3_dboPajY~Nk%GJg3&nUaz+
zIXz9GsHkYQGmJMdG!zB(e>dO>gAi%9u&^Mfq48;Zd)sPz5WB&0)9*tunq0u2u{7Qi
z3`~LRH$CC7I1bvU{ghNxIYmVhMn*<kTLV#%5fSSjCADgnmo*CV^TXBa%m${Xqnq9T
zt`<Td6iU>76!hs!mb$tfSgn(ja>}}aJ-@MWu(0|8gK{b>CojRq#>P@(B^enVmt;vv
zNjWt&ii?Yj*;!d#&4%{&bstndfBrl<KTjP;ryU!NOP4su?-&#mBw2>J`dbSQZ;r3w
zWVu1#u4~epf`SnX8adnk0FBer)J*w+X4bi0Jv=NaA5Ut7#)9~^Sp@Mzqx4Pi$cU8V
z%}I)*wu1{43e7DS5S9JnP{Gd5UTSNB5BqquP_@I->T;*I;)#}-4vwteOmlyZKtLsq
zPnBgxJ?xJlw>nv7Z*aWG{or7})>>1#L4wxp%|{qws%L_(ccP?h;6Qo$Ese{ulaxr{
z6EJ+!+sC`A%gf9D3jIC}p;vbImp_>h;U<y;RwYFk+WXo!HZt)V-cAH>aqsNzO1QhX
zxjfy^a3qE62ry8z?mpc7nOt2Zo<;6PCegyo<%Pu#An&CQBj!H15BV+C$(c(Xnf~%1
zy!G{R@0$vgP1lQyi`fX+c4L?O%L4Wjhuc%#xn1}$j6QS>3TnUZI2}EXTue6Yol}e7
zaAdbWg79OAfv*dTitHU`^1h}pdfOu+y~ToVaMCNbFRa*~{^l<zD`Tzd2*2%E7TmSL
zgvEtm#D$ac0bRa95C2LBuc{mV%l8Py=9eB11<$9;T~2y>9U^|w`xm2Lqo>~o<72Kd
z{0*hR*-{o7kDv_*n0!x>0&GidkFB{zG(AaV%mXniK7|h$sC!;)jEs86?<t<r!5CxS
zXP>zBE^p5^zXSIaE!bViiS24Rq6c1{8Bt6G7{~=FG{gx4#q#FTwrK0{4@m8P^>>W)
zePpN%C@_zIugwXa+~WJsp971~YvgYS6WrF{Y9JIVFD-jHTBxLow)jM3CuYMJALc*5
zE02l6Hb#Z)zwQZl!1)#@OQ-GNt6>VU)lqa0nJH{T*s;Ng{0g*d_<@F|O1pKgRI{o!
zQo(aOZF&tR!7YB<KN}O6GBMx)>a;m9<aDC)GX+$4UwR+Tl@0kK<8E~aV(zFAWYWu`
zKH~oEwL9vwWLu>}PgEgQ8GD2oO9{8})Dz_jToqE&&@eH*!inE?`1|Z?-Q$!^E5E(+
zYu!ZyVeaDmQS6gV@nFam8Il+-F#f1^V>vp_0G~JyDt|Ne?X&lb7MdDs!NlY^yh__X
zaT219z#64)0o(an0{4!wrM<J$YkGQme%ngTOe;ep-z<FR`t?4ME1CWj4P(uz>i1Yy
z1H0|GJMBk;r3#Y1b%*3#J8tla|AP~pP0Yb|7nh*G<m({F8O42c5O5k))a7B6#{Khh
zgFPxU<qfk7O2)9*5LeAmb~icdQ<q#V+@rgY_hfUdt*vL31Rha<nZ<Ag(Z<lo>42ou
zEJ{JdEA8FL%DPKM>y7oT7pc?;gHcA8A$+1ie4-pLmJ8y(9=4Q#yRXlwJeRO#y#KMF
z*o|RYk9xBE31%=xyj;BX<Ivt-eoYLTJKzOU1yR4gTzWOO?zgvRS<!KEOE>=8*jQp?
z{rbui;<Z;Hl1VpnL*C~Z$px?U>kA3%%-3pbF*eL!W^!*O8*y=-PDxpL#L?qmwOm5E
zbb+6~fN_~*dwj^(Dzo`P%Fr-R)9?A&&6o!A?Dw)*JYR2~9_)>ctvt*3Byc*^IQ%tw
zJ}CN~?`=aJZ`9G278j2mP*G9U)sfCvU-ri354lgwNhagldzXk!ez_WOA7=cl_O}Ha
zZmNc=Yied%Suq?iBi{j=jA~$PtWLZBfgz`zT{yte!%Scc8+vznp85FT%QNy#Pp@-P
zJfICYLDHGdKmV+@RMk=<7*6Laa|`6Lb9X-lG0tR(<>lrUm-yTgysVeusEIU>JK!T~
zSk81-QyWo-jrDydhS~k<NiNWeii(aOMuvw~{>RR6ShW_5sF-col`^OFcbP0JuziQQ
zA_<v111Czeyb8_HA49`i{;dy5oVb#5vK#8~ro`1{;0pd=$rx0yB{GoMGB~FeQ4HbV
z%vvu*R+tfU;oG``DQlaMerbb{USHl*Oz98x_m}^<7~}o>zdh5tO94Gs82Pr|!^)*L
zAcd?+O0W3czlV{umc41e#1)u?dl`;&s);mFeo+xHZ1`f#{8E&qGL5W(FVoO6WyV>k
zhSq8;Lhrl(9ub{S;w?7PX*{N;QlNVkh?2hrCQe&o>!J{2@4LRfzT-pvAUMcA;Mg2+
zV$!hCBLg=8R|yeokE#L57lN*2ZK2$<Yl2pry(ka&<mBWp8yN^P9B^D~9t2DBOUG!s
z1sct~HteTx5x-tGcU|m`EzN1EsZ|0S%N-bg)!s@%pi_Z%tII+wrBbXtCT1JKLC!(I
zJ>}bC;!HBJGi~9>NE<I;I|ZNgyf=E3(8f11aq3Z&d^F3CD<nTiqR!3BJ3gdzB8&@H
zc-iFJKy+XQT*(*P&X;==+;rzfA`v?~*o|++8o>v72Z{OllSRs9i*rXOC&1>8B!0OH
zC;IXS2M32um;vWHyL!vl?%$}CnJJn_*_YketYB5icx>FoSXuSHEnBOQ^ZPfK3Cq=u
z#7nzsQ6aGk!U4PFxELDWIH#OH1)IriQehvZ1k;gu1S=~mkBk{FKw_-GFsCHHeqE%~
zF$jp{a(k@ja=N50RXn|#`H;ATpdm!@U0o}}*s%5@QMh{ZGh=4jlKi?`vYG$et&M)C
zJ?>5VX=zOw^di+g&Dq`2lq$e#o_`m3IJ}Q^OF)Vp;J&Qoo;Ul#wt?tqR`o=q-lBuY
z-24!`bZDd!?2A@Qz~EyrBR*GYr$v}sW*^}62hL$*FIQ=9)2o$&2skBUS@!0_jIhDe
zb8|_a#AcoOWfApxzY{#w2F6dENsA=$|C9|yW0d;Z;^7^~1YySNoS=0{L`G=q+GT`t
z{cWu=b%gdh8Nc5Rx6|wzU7i>X?z$w!pLV93o}FEs`$$b4FhoGrO$XS#+u?xSi#&tO
zj?;Ck1ciDxtfpcJyEfz&_>Ps5VFdqT!S-3EsnZ>}Vw=B}3C2pb3DAW-EJC?rBiH1N
z%y2uvcNSB#IGimBKOY_&Q+GxbqXXs^*Tlr+C2$bX8m_?iK`-c1`1a9+Zit1w2W`{Y
z(9B3{mDnU3a=F-JN>JJ-!~{$xjDGQ%leG%w*<cI}#Gs=O*x+w_!f)Z5)31cwZ}iOG
zU{w8L6$>3=k>ZU0Ao6x7J5yH@eiNq;r9mlEn@*WFw225eX@7fgc$gVRn;xmHp<zLT
ztSB$f(7&d(HjzeaFCwe_{QO)~<P2lu<&4|!4bk=J^~ZWyV{GH~V)8{<H_G29%hPnu
zPp3#&3G)6G%nNBC#0}n0UDrY(CaW3=w*ew~m!9S2<U{18pJ?p|2Sy3;@!@~g+LCrD
zjfTgow^{a$sAI@OJ#dwW%p*E}$Yw;P$i?TRSm*N<QfY<;Ph2uU9en#Q3PpT`nQTfr
zgI%5<8}5z}#q0rdSksfHk9$fakw|waKfaz8Q(-PJGkW8?FdBH%7;{;lTy$jFhIJ_5
zK)S@{c4H0FUC$Jon7P{-A&}of)42TI0n=drCl!Q(GH|?9HxlNrT&7ha5e@qexOq^V
zzTg|2I*r4<eH~J(A-l1ICtThG?3y1)SLYyPTx<^RRkAzCY7WFl)3~&+S3fY>P*fBR
z2spGYc1MXGwnHm;1!Fsl0u5VQ1r5?W9CUTNqC-UX?rns9cfK573id626lhXK#s2f*
zFvKiyln*M}_;ThE4tF3^AWHW>8V`=ZK`Eyy$w1um06X!yCzb>Se#RjJMn`v*(Ji&U
z_?>{anp#oU!3~RUT~@|9u3>kgwh}gGasrb?fcaeUdno}7#eyYjy1}|3cG)J9l*boy
zTZ>{ho69A9g(QBfyf_lQh1fpXOjuA1YK)3hUFQZ`rHIdYE-JkOjq-8X_w^4ICpc~3
zgAS%Zjj`}>8^9615z16*OiN6Ni1m|@i%<G2!f12Wc`nr;r?N`Mnzu~3LZuCgs+r`5
z?1Os3Vc)ub$OM7~jh^m5eoh4(nXNwIdom!gbiPv*%4nJjaJ<9%M`|~gX^|O}t7X%2
zbO^sU&_!R3@tjGA=ycGH76W$>)>R1nWU+3hYjq7N(#w)lSO8&0`Gm+&Y3Bwjl>5?2
zD2U7#k?cZJODi=YIVn6Hm_<)P>1$25f>A|{$M5<6g_sAs@Pg%SZEINkg#K7|qShj!
z;~C&czRL1)9b|-J!>x*<_S+sO;auo}_x(N}Y+rBh77&R-`X*>7z99!ekUrhd>uT{&
z5Xaeyr(`Tsw-pBSDCG;vIC_1}QWovU0VYs|6!yOIYh0;@H8w#R!C=XO$9=jMVn85;
zS2+QznToU*ngGM)n<>-tvPP?}#c#`tg4YPHtB~Rx>wZOxW+Un{EjQR6K}>#d-&-Uk
zU%fpzYQGOc+9PjfS(vv!a%nL|%hR#O)(?)@QoKUdzx?-%sLKG5Bz-eA9nqM0Q?w>6
zC6z!dtF4`8V`rE6Mp;>z3YSicS?CQ-OB#=>+Se40_d-HKaw;l6oTSmhl9Q9e18>W-
zOYGxGr{-vUbTvhu)+Rvg60+u>e0_I4c0G5!cD;8Ml$0oe1W`^=@%^t~zj7U}FE8VR
zU+HUYL{Ui(lM;QxdIVD0!!m&Y_m}wO?BT}z4v5B@UGC(Fd0ePrU|@EF!SZmYkvvY9
z`G-T?csq)y6Z_~+J*1^*vH?^|BYkV;j*bbc76EkW;NGsma6&%&ohyjysz%gVh7!94
z_DYi9%$)ewwd!VD%JcED2<>ybgW4@-Wk0)MKf<c05!NZWDJ2^B*&=7fLC@NEKT}j=
zr23wgLr0EUsm8e2xO{Nm_tvAWqW<~3$fo=e2!sMg83ZI_+WWkS5x0c8L_j|02Qx)G
zTz!UPsj?J-d4Lt(7$v=G?Bm}8e|0_oNQ$;Sw7^u~Tg<L38MJh<VbEw@`{eGIoTZ*p
zU8;hB?~-7K?0%%Usr3P?8@M_KfMh+Vp+R*tdEqNXi#oK9w2@6ZmFolG>5!LFSecmg
zOZ^e0F%2A^?rRomZcbJ>?@rgf7kcU{Dj;jEu1s^18k(9hm{ebVmXRkC3sUVo9}Z=+
z=%X>W;m~kw(EC0H?FkDjGaZEe&jOVia+U3lr40f8as(9z5!{$|cGD#e#>U2$Q&anR
zcXtOF((5tq>FJpqA1CeV>e}H(62r#oa*)Y1m?!b8uNf;*PhFr>O*@Q}wARj1;9&_{
z72w>}zOt2LulcB*d^qig34K`pI6#mRSGQJtyw*B6)Zi><UFE0_QWh?GFehp<ThYIG
zYOYozdo=u0Rq{)02grfW_a?|+66U*38)qb8rsi+!pEraSW@ZfDe&~fiJD2VjXp7)u
z{oFfrd9FiD@)9R1R-yoLqN5LeH0rj^8(ANVj3GJR)t>_al&%lgC3mcy^Piu;UtL}0
zvVx6e!YU&pF@FC1$-w*lG((`@jgKM3ACZ_)g~WInqvb@^IM|aTuK-Hy=X~SSaN@w)
zU83<!Y}2Gpjp|(2sAYZPf19K3k`hU#L6Z6d<D8+ZtNj+OnGsf}zUB8aNDBmuni+^o
z{f2RNPIEAgELk>}KAQ^&Idkj7QuU<p2C-3G=mA(pm{7lG&6wBo2C3rc_&7!)j#dcU
z#Nbw{rlux=pL5_DjjY30577kGBroQxdY=ci9`z9Pyw2La+S=ogVMxy0uE)>Lw=pZ!
zH0HT%HW!UYVr)dE44cTMgxBG;-Q@%Mn~7t%T!Ln_=JDU#88qg0cC#}@XJqmId$U&o
zGmyxdN6gZqGM)_3c7VNWXBw}2qGs>9Aj6C`%37Pdxtr*^H=@?J>U@>Q*wfc={6b__
zuo~!*h}3?hvU<11YT_doAiD9zYG;Pzno{hcWvH!*4QC#E$(cv#SVTlbeDA}l0F;%u
z_e87NVf|s-lN9W9@MWbuoK`88BuUE>yH@2T>$~r4Zd`wMMyCxR>)lSytY2Hz{lvF*
zI^km})>3TdcfZ_dJ4E=0;u{bvZ9)>u3r_lb%@QiUI7)$_-P~`{7+_^|)L>fsSG0u7
zZ7|y`(g~Eck2`-hIQr&_%q{cijKcV|OMP~!^)^5K|D~wAl8r66r*)pnIlX7ise$lh
z&zJl1@~4@$9h*=T{UKlm>P9Ik?5O?D(4^+Iu7|Ye*BC#Vmq<0?b~zT9_;|30k0BV#
zt4vpzGDf~4>KsCUjTX_H1cbQ5uaIB|VND4UQjxh>b_JgV@k)aaMbyG9%J{G#gz=*r
zLVxH9_cGIxlbOl=yWn<yZ-UySB-cn^P_HvIp?L+gp*85@s%G#yD&D?Fdk+p@6}E}|
zhnz4?1Qh)@blS~=osOR1s!lEjNo7&xKXk-s4S@_?k}UH>mv6wMeYO@YPs#57ik~f{
z+n%`@o?zM*EcAbYr~DkOOd<rm^}wj&)gfh*_jsm3-F1q1e~hDf%Tf71Ih9S7_KfS4
zE+w*pyQbfE(Xe>iTO5rSH$PTC39KxuL>bCM<rXLF$vxodps-z}nh8rou&a<}EE~mj
z6%1k*NgWMrPa#}d4f@^J8!!Tn;kR_pzmDg_HZ5Ejx!cn{7))W`>aJ#9u!6dn`V>%t
z$dC|v=!v6$_||;<kYeZX-5DL~z1<}KZRHa)$K|p2EF$Km?o!|8wr8~JdSfDKXux^a
zD~vYJeS&o_^Kfrl7nkHV<4TwyU9S1e8OU*#X{4iKj$%=C+mhK(KS5k+E_V<_MLQW3
z6>2J#oMoG2{ynFrN%mRp=LYCu)2L+Y^4&oHqv75CMIIiX<?ZP@5#3vxu*@MORZ+w<
z&VDupb#)p5u2?=(_opUfLWjHsI_f4fA%^du?LXRZVMwRJdd;L2`jO&WosMl(ZZ73q
zg~hO|&?KS&u!g_o8M+BSZT+!nMMSH9O^3dI=#$MUdg&qgWmJbMWHU50R81rTfZsw8
z(gGp9a1omm>~OFC3U?Z~p+}K=5r@+#m-<vAfnyQXRmJ#%C^sZt+9YS_-m<TA^y)_n
z^cnPlCCY}gp(XG;6B=&XI+yG4){Fm6YC|Y-%;pUr-s1fl#>dCY2faV|z=RGC4({;>
z2#nRm{APt$)UKG-$R<$lE!?g$ItH<z4Chpfu1SQdi5E-{y;S@1N7y%ezwor{lE<Y)
zO>|Cl0hCpgz^gAHr(E<N${-0-j?qw+lvi3Bx=HMF^d{Tf`fFD^7U=7=G=PZkAjp$n
z3J1e3igF4eE^rSG4RKa70gy2Rl{r3?;gTW1X^P+wNJ`lDq(!~jr^$E0T(A+udQLz@
z^Ff7Mz&smF@^}h4P?PovXY-&6$UbmVhX%32XXlV$LDM|T<UU<xv3?co&`n_#5Z&PS
zqs$}KlT7uB*OCFb!sD>a5WJr(W{~j<-+IH(<^Jp<x&&3H*oWyE7a{FdHxHSanIRmf
z`j*xX>zYSORss=21q^<@KXbW{d5X9o1?_*{pbP+9+pN}xA@I#BPlkBL415wVgH~7h
zp;Z9K#so>EqZD2Tum=L*2k?|KwIA^d%qpj#@Qsx#JD~I4#3y{(bLR79;N6cb!pc(s
zzd`jj8xIP4+tiVfg!OX{5mJC)Oj=lr)YYuLp$)tauaEAee|UIUb&V#_%qJx!B}%Z}
zR|v#FPFUaC#`}=gAs7P9aJ{I~$!xlHQ-E_$nxYT*n+|r01~y!ir@{B{j7=a2@%Bg(
z>vsah;}~wXXCJ*ieytWK1J+OANJ~tC=HOI%5^fIdHn*B<v^GA5OVao6-`jNwAhKe@
zU~ZVw|3wQtS8Ot%|Mk);s8}i=9}5(9j09N~F>msJN3?-OoyN~_i54%O;jXD?@Kzvz
zm+xU_7gpaEd4mKPz{c5TpB=O_ZaYspt(e;fjrVkG0J90DORLr8=P^XfUvCd`iF6G(
zTmS+INaI`8nF*}`)1M(=LBl+-4-{d%AS;-VZg-uH7Nfp?{2pRrcfdqMAY-p1Kx_Sk
z1bKeX%e!VaW`D9=QHwzb?4eivdca}TZ93CA3P;<}CiN)f)_1}>;{m4H0>D0-)=5(^
z=RQz$uaTx?wm$DYJ~r3*J75Q8Ak<rJ2d(^QY-|MZEi_*1yK{pkP1Y}8)YJo&Gr+lE
z2Tv#5eE?Cf@kiS*yyU~*q7{n8-_QhtXL!8t3f}BM+zB9tk?;0AndRl>XO%XDfUj~}
zT2{<H4YNT-ohD{yzt{blomDcXIU~dB!m>W!5^JgeFpd62aRAf03}OCp*xe)pl1HT6
zEcElbG=A|ez^YHamQ0$=5^t!EvIoov2X37CUp_Pon31W;Jg$poyGKuFv_NxSKd}lU
zZ0zj;SP-)BLyX&Q3H>9$APG^~5Mqh+M<r2v`Mmq+sCZ?R-E8m0>=*3Vj$BvIOkfgo
zw|*U9jEcFtB>)3p@qLU)Z|MjSA^Q@RmKC4<UUsw6#(UtMH>v4Hgr{ggQxdkeH7l!m
zd3hxz|9PnwQE{_<9w261C#cqLZf?}o1LM-cxrp46(E|-gV&=jkBFERO%gZLF@3p-2
z;>p6Dq*y|m?Em~TEFiVIskwQ1QM?(phhB`->l4QPIc>ZPN$8I`h>t_s&7ZZUV{TT~
zx&J=!!dCqvVEv}A-?fM_*b|I<-0S)1`!&4qC0g)7bN9|!47ZZ4aTE@7Mh()9^bm<l
zNii+e-=Pe8L4pYUTHn@U@F)9U?BfAYRy(<ZDRC;<84gw#h1E+w-G>VONclbp;4CWZ
z+T5Phc-$U;oXmyw-T8!HrswDPn=MIJu5(lSi3vLTH@0_ddhY>=%fb>q0l|9!%G+Xd
z^7YBab?Q6;Ql^*9lMbfDqxd~5M5}bTzh6<x2P`(4P~qZDmEl-%NjHrQC<@fvR9sw)
zmJ$3NNVmjz<9&OVWI#8scjtAPH&q~zeGymJmX%&ADk@;Ef#+{t*Hv^`2$zM2U&1CB
zDsYkz5CG^_86U$kmEP66eQW@GrsqBY&fWLsSCPh~7CSEq<^>3y-rscIU*F=>Xh#DD
z3(!oUN;4F&^)@Oe=l%ZCQ8W<i&ealyt>f3@l!{%W2Ceg8jBqvs<e)7Dr2CMx2!vsA
zC{GC><zG%bog=mc7?wrI9Q^^4&rntT_U9|~OHJ>7cR=N=Y6VJ}Yb2c4T=9}M!UG#_
z&K>rXhD#rrQT~SguLWjv-7WQ(@>Ut(6Q=clb~unw%+P)Mv^?R)#K@Raxl?F^${U-o
zP2%_aX)$J9Ljz{6lO^S*qlNtaHC2<pUj118e>(pnnx&$wj5}$j>j)=g)uP{je!mQ7
zR_ABDu~_ea(Ml~*FZ8Pa1lWqN^6W*+!qNUPa&j6AyB(N*+5J&kZTG7_NQDt})5(3s
zm@Y|8AO->sQ@ZoNVbKDYJ>(5+(a#@JK~&%o3+d%0RpRJ~BcdSPAemK2i-16LAX6DV
z7gNY?1JaBe{^0LR3|Xa00J#+VZfPkiEG)cre|2cJ-U-KUx#6>qQixRlzY!1DD7jBI
z{P4w84}3&wz_Sfzo&tE#i*esTFk#>%1563Faa?V4UmN~txz!&LPGa2bcVS7S5vEz-
zbA&p|@N_PrtN}NG>{q#OAha+5jE)k~!3toHki{CJMZ0V*U7bRFD8d2*1H<i<WoLeW
z6wqRfmZf7l;M)LZP6P)BCmZk&TYdTJ|0l*~goN=q*j=CVdXtSX>|(hTq3g*)8*r*B
zT3WH*2&jw4#l@LU{-+KzGD?bO)30qIXZ#Gy?}7Z_3pdLZ%yh}#G~Q36LngS<V}F98
ze>{_Q6Y5Er6`H{HD8ND=*D9(gL`DWo0O)=YW6^mQEd>v?U(+jn2O}dNv(r6zO0D{5
zl^dga+R{JGRD+)9XaaU&Ojb6x>zT%!mz5dAPDEf`d=jiKHva0oXK(Kq?ZT)RpoVu`
zkl@7ofqlrs3SD5s(7@n*^=Dg9LoGKic(8O1&X&A_pCKe7jD%O*(b2IV73F87ldv4q
zpM1k_P9lkvKu$>E)BTRDR*`^1Q)z#3_3>N2cOmM5upST-!vNRd4j11QjJIZ^)yO+9
zv6%H|YJV+SAZLE>BWUR6#*_V|gN;;IyF&#fy5z_RrQpEoqUKWpAWZ=`jn65o2g3Z0
zm**MHSb_qXS<b#HA3951?<Qn$73rM(U(9;dNSH#bJ2xJE7)JMB3TMGUT-0H9c2;0<
zcrQ!2)O0A!uW`>7swwu3+7I0#6kU%veF=4p#_xQ8Tj&l6a<Ye>?UpDHF50(7#Z$!x
z_9-}7HcRUYF=gix4bMP4fKy0l>Gcmy@8=(DXW)bE1OLXzei@Kvdo%YHxtF792z?@Z
z9~wJqM7T_NhEPoyx#~jcF*Om$R{rXnQX=pq5ouO1PX_Tsq8Tq^SrV~9&^^683S{Z>
z=4R=*3-wOK-q>kXZaTpSaO-^16@HE`1*tq0>d=NO$AElX$hY9a!jDa+)hn&Li+*zY
z5^}CCMH=c#5Z0O}aum45Rv5X-thA;n8CKg*2a=sohH1WY<0pT=z+*FB`Zh4eo4qSt
zD|3NbHoK$v71|SS$IV4In<O_z@?UX76ug{F*-{4I3?#l<`f8Y@Ms~p6SZ`K!2SE;U
zLxobr03iqd{Q;(^<IeTwdD4Etk_@ka*C-H^9DPA|ZMM*KqQhP46RDM1Urc$g1k$~)
zha7xe&H$_Fr0_k7)M_^fN15jPYtfbZi+Y8o+UC}86&p9ne%V7y>)(-L5G0y88y3bS
z4$AQ5Q38_YWj6&k7S|f&P@>563jp|S;uh5CdH$KVrQVldm(NH0?$f|lW{tb0X78Uc
zG1~+TYV)9sR(zg+J>oy!o{@j^z5n*PEBYhURbfR&dO9vVoso;nq|QIlPigLp{$h&6
zwPkM1uLcss`OE3@<bjs0kA9n*EpoESG$M@E#zdnrof0jRH`9(T8$D>Y3Vm58-9$kd
zo;+n}$oq{?>5pdjZ#t6gMZJboIPH&WW#*Rm7quj<gVr-lJ~VStdRr5m^l_RxN~sOn
zmpbF?`3G&EXS-?rf0{}y#-$l*dTHu~PQtv2B%PX?(y#ONi#40O)>{;4!y;MaF!LuG
zj3#f$k+W)0b~0S<sVMt0_oR_WWFCS3(A*siImizcSqbFCf_jsSgwFHER_tTXkxa+_
z5(~7|P~lAed}r|4%KD&b=&pciS|SGh>ODn%_YodGj`1rgVYim*L(SCDv))I_eJ8yZ
zOq`vZ3c<9@h|jov(+!s(d7<AuGGSyRBQ!Qo45sQJz5FAYS_M$OCb_NOeZe_HVKi(^
zd>=^aftH*oj)FDWKVLl-qA^xCnq)*Xb!{-nzT2czEEf7>cSl>h>e_OcUJ+IcBqA()
zL?V7kJ;~OMW|t}7t63I>Kb0jeYcAj=Iy{lx_}RSwH(#E{r#1F7t-58u_ZJR%KZKZU
zwHUj@C$cNh9T=vS^M06-SO69!K|xooZp^W>j0590B#jiuklnml8D7ONrQi9z#JMg&
zU5OK`RDa056pa7S(`-yj==D4Ly)@BmvF`N*4Q$oYg=Mf=N?W7Uzkf~*I(GFlW%c-s
zd;_&NqcdA$*I8385-Hgp>^U2MqIYe9PA7$vVi?2YS2rb}>*C2?yj>Zd$VH8oj$i64
zJ5)7h+}3CtYAB6$VE6`~IFHy2KA>3;d6()bgx1w_MU<**x#YBW*M!xzfY+z<xbK!Q
zIhv%I5EZ<z_}n=vgI+6%n#tdSg!Hjui?U{EGedIVvvEZ1#QTKmi!isifr1YOJa`<o
zozF71wF|{^4fC93DSst$cVe^avV_DzXG=IWz$vwk>ir5VnRe+<qxGsoRHG$5LME<g
znx45``_wjd1`XAyd(5RJR6^<~V<)-ao{KW*c4vgT`Dq;RSCqiEs5J7e;ufxX#KF^8
z<!L+Ai)Qyrd@liNFcLZf7Vc`8X(G-zNEU=L)Za$&d2}DU2?q-8U%c95=Dr90`bsd)
zt3h+D<~@yaCEu5^>H{02GRs709LmCf^P1hNQpl-9RBkC&d22CY9+p8>um1|9Pj#x7
z|F?YEO)>+g37iNV>cXod3}>{i1%u61Cx^O&x0<Qp*8X*MyBev;4Y^ZC7bxU_nT?ZA
zmluxvMrM&4ohIy=HB8`G^Fg|wk-cZfsPe2yiG)!H=W+uBiw%#Mqh%!VaUULFzEtSt
zhv8b~JoJw<Ee9L!fznk~B1#v>NsRk%SGBsw%de50^gqVl<LNuMtqL6wvt@;(LLf_6
z*rs%DD=ci=i{Bqj@}mk#4#dg27`j?Q@J<3KSxg++F5|muCUdTjWkD(W-VG=hR#hes
zYwK?eqb-NS!%Z8T>ZYP&6cw6k@puXT>nDJT#Ke&*1l@tI^edCHrH`!xRKIHe2$#B~
z4QFp~uyOwDxd{hJVCaM!rPgQu09h(7DOosv{pEfy#<=M$D}&Z)MMfDTp*>iaY!~k<
zZ$iZVROoB#mZVGF;H`s)(AmX1P~P|4?0dnzc&{Y~zO`-o0e5oPQR+=DsDQvk)TQ#Q
zhOH^98}qc#OmN_xKKZF$eIAHe_A@6lRR$9xWl+PrP|jUCRh-Wj@Vy{rAD>LaEKiiL
zwDq+_ym$xcbAhUcdcZsJ&CA&fa(j$(^d>lu(1pk(f)%D^_FXg_b_-!V>nMy$%oR?q
z7vFF9AK%~7Igiu~rgWJJ%9mg(kubOR-72C#h9*Q>H;OHi^bvm{N<?2Pr}ktTtT%##
zaH^^<5KH)L{sCK=^19JSYnCAc!2{4OqMr8HIKd7fYX}Y-%#^obJ+Md_dl5P1>;A!|
z$NfWojEA;5us>a7Kq!}H7-MBNf8xK9Nc;wc(5zr$BvcvJDce(j`WVqCv8J&UiHl+&
zl%RMgi;Drk9^L@Ju*Cb1{Bk$ZVlY&zRe58mlOM-{aP=NQctD?ljInwtFl~qU!1}E$
z!uO;=lAw$ZAOaF#oB&BSTRe5-tSV)<S`>w-E0NBiu7n~3ELn=T(+h=`A}J~P<Cw-}
zRgNwp)g8-^Bm5Tdi5g9IBhL&%VIQyJ_GPp4sUQ?wFX{IZ@~54dQ+b{HkJt3kDM#-B
zZ%C~8mcX_8=zjAeDTCOl1uP^kYQw?F30;&LSa_Qd@BC-6S5B82c`!Q;-GCB^>GNgf
z<@NuT57NyvJR?5+hffnh4EzOT%}vMcR-rrMH>dh@cC~4KjOm}87QpO{0859DjGU1`
z0EBUWyVimMHIDx@!WFqscP~J*LKnj-6a8kR1rs+?>+7nxfOuXha6l^^%rV~g?&58b
zp33Y%lAl%9V<9ae4Fv^{xOi>eM>dpHRpYq;<0T2db*-=Fr$F}fk}<@@9swwUH=tSc
z|8!`xKgcpik~fF4tz^sRDnl1JIxPNEv*EF*^s8Ee&9|{;=bKS8-Utv$a{qlKNE&^v
zyXGoP&A_&I%@N31KYkX2#e(8qI{KH#es#|=6mYycx7N}H7+p#XL&1VdKxrYayKbij
zHNeA5*bzquk0q%-uP@T-Gb9Ha|5mHdz2K?80fO*ixky0)29S4aB3!X?KM9R)R<ct=
z0|y-BOkPb5e=;;Wh1Y#`d2MZtt}m3xntKOG&c0{w#^l=l{L^G!O6IvY_W93Q-p^Zi
zlP(@YZ+**mqqa?yC%(>+TR=3*_b)(Zym#_1U~z2`01rw>_MQJoSr3en*sref%!UI{
zDaf%X>o<GZm8drNzp)b&vh1$+)rS><^cn;=?Jc4}ZYTU3fTSQa>s`$U5Dsnuo4oW#
z3de35zk^$tEMu}HW5&t3PY9)%#+XVU-0N0i(c|C-prcX$!@a5P#z^d}*y=YOP?|<r
zUKFPk(|r|}QZIQ_Ejv-Ab=NYFwa%J4KYF4&r1rH<JB&H^w>@gZFQTY=NFDxd_ft}P
z&5l@`)mr`81W@ZG@8W*gqg3i*vG}YJbp&J%)WxNx;#yi-{b4izVe96HheH%$B0t&D
z__?nz3(8<-%M?W^iKvOGgC3}Io_j~FYXuo2!EP~z&|gcLJKtB-6gJ8ff7&*T)gFJ+
z=RhBslGn^xzrEa#0@Nz=$q)Y7xAnwiynxu&L>uP+mHNIU-}<k-_Ab%TOA-!#;?}nj
zvlK1?ss%--f1Q`}mez?qEGN1wEHBpGIjN1ZsOwp~irSP+j6EpJXH83%Ebf|OYJu9g
ze$<SXMK))ssy=@|zP*CBej1TzTF-c%De68g3b9vC==*Eg0u_#J9n9TkHZv<86qP=n
ztx0^?-k#m5CX>T0U~DO3CJx60N34_sncIKBie5w@4bcxkbnNZ6W6cn+g+M%*wm1Ng
z?b%&8oHA`CXkFX&q7pjP{@@(>Gf=4|m-(QXcZq7d<S>vl1pMqo8S`sii#8#vXto#e
z)Ai6={X5u&1#6>o#rq}87V!efu0JI|G_wcom?m24>gIUTI_Ot{<ceyPS{^KydaO(<
zzbqnMkqg?M%=002h8Lr4!tN?DlVSyUD=CTkVaxW<nP~`}0qYudj|H_&LF&|F@O90d
znF#C3Uu3r@hT>_z85sCh(-<TqWK0oSSzDJd>A`4axbcLnX4IvFPu>KC@-S%QDfx@e
zo=ex4w%+?NMnfGv>9kDfX1YIM2kJLFOQdhG<T><^8KFAYjy_$CHrE)K>(#rpO>o_4
zv;GmY*<ZxjRQY7(_~>61T%G@;X*VY)M`$#K)9^3nYN^}`je_u>adjDxJrZN%Ucr)0
zmq4S6s@seBYF>{eIqYx``QpIu;V{AAMbr7GsIaiIHnOEMO)o!m0!Hnc%+G8Nc`UJ7
zYmL^OS%Q^;5DcbYdN=#no&8W+O54N@aN`MmI!$V?*k()RSd{WhbB^{VvM%3o!}eH&
zk>1s`F8WScUA&bFD{XLXPewrWOj5fwL0J3UcFS6;&l}ox#x{2BM88a@F?kFS>xq5o
z9i_$e*kX*b0#Ws5lcwuW#ul7D-|6(gX@>Q*C7;!A!fL+mcPB6zN_r-yt(^}N;MY3q
zU0(Y=vAs*x`&94fJGe*Wgb<|b)z0C0I(><Kf%y|i*-1>f1zOfunjNPW#UuGQdMuWh
zruvS6!JUQTjV>=Fw&e#~qVeH==$88Pb0Sa0<?g&^u@Nq`3oG~saDtiz3@+cb0AxeQ
z@4hewu3;h$tE~WIn1C4zo>K3_^~Q?Rosp#Qi@Dj!BAOuy3N_#$m{s`{DGIl$5ujXC
z_?-zy@hEO2tXd<bkg92noqL(d&V(Ku9+s43{J#Bh@rL|ARs+OPq$ibs2sYx61|X_t
z*Pgh`3HUGK(H4ijU#8KZr`-go#TUgfM$CFn$70R))7Db;sgu&S7X<reqv3HU7NfxU
zpVn45){+g`IOxpDN0~I%-ene)MGXcDIW|=s%bB^UMHw>P3`>5A`MDfZ=<M4hrGq~5
zZ;ucFP^-_XXsi2QGeATL=&s-X{2@6MO9)&)5l3aIsz}G-OF(Rix$j(?E9t|+-M({?
zX`D-tmvdO3d4jD+Xj$i@PB=fZN0dtp;8EjDt5o`$jM$<uFDPSeq+q2w!()@V_&xMI
z(rg>CBtgwOC8W)sVOj6#j+=cqF-c)aT>nC1brdAF|En;3^KZQx4SUMdBu|}@VXhdf
zO__y-#rPsVNrltP691=*sve3iYwJ+OBT9XEu}>9&_+sxHmE)tLstz?W&K&+dhx1~J
zb&8(i@wf5$dGO@?xU0AvLeKaTm-F=}iUd1j<DwcWp5NF9$F#&*_VFA5ro1s-Aa4i5
zM|S!x!*Hbi5)?|33&algj!*Zt{RhnPLk}-fPUp?85gI{f5s&11R>s9WJhSKtPDvsF
zs`K=8oO$&^XP8QH{TT1h%0Ka~5Rb&C_FILu23^@Aj-_%FTqsadnd$o$iU1Pt=~@5`
zPh7gxVFmZSlLz=kA)U@rqgQm=l=cjS4&F}QG=LEMI{XP>Nw~kTvgTxFcA620PPfE)
zeA&kC#I$)Qv6oPoJjG&Be2%qGlnW1xH@~>JnxGeuXqJ==z!ZHidgur*{hY8;<>Nr)
z;3I03QHN}@^!fB{#V`TRzAe=J0-R<8lNpeK;^hB;3iMAJQELRQs;Z!nUF8&oY-?oh
zoUAm>Y6*CCZEa;^;rQ+R?Wtea@`%Gja((1cGnc70j_3w>Hgu=#-Io}k<iR^N1K!V_
ziY7A#jn0!+W;ZcAUZ8@+(*U@auDNeMHdCAdJ5A8pxoL&I+-BG<E4D}$K1{YGSX7k5
zi&m5y5AJ9(M`Ct$D@!Dd(XjjmKuQBLG9XR5fOuF{{RUUCx}atuI^)64iQ`w)*U0wQ
zWvDdudu`S#Kn;a$_p`<0t>wdNQ_8S(<jZXG1t@g=)6kyqf}6&tq(5}&w7vaH*&UWn
zgF%wG2S4M!bo$Od$;Fv&Z>VXX<{O$hA21dbQUw-}V0sS5u#jNmmpZX_>ZR^(9{_h=
zMTkfoJ(3ut*NT5z2D(u&@bDLH{<mtwd@S#>zhAro)GSe)_9s3zyVPBRTh2Ep19N4I
z0?s}Th?n1VK;w5yzWlIpaq@M1<Vu6e27$J|E|qOBCoi>)o}9dE@c@OscXDB2zmbiB
z@ta1AlVWaeu3buwcetSEk(8)-nW4?(=NYnmzCS@9<pJqsO^gFlknY=w9?A)0d`d4s
z>zz0dq==USk6H=H8A0`TS2R*{7m!qa0|TM^`+I>(Hue!3vix>Nqe2r+P0jz(D1zDz
zZ#p*>$8&;hS1zj+ztT`s)B9StVIYR<cwT$1rKcV({sdnLPv^%8%4CG;hKBj8TSjJM
zymZ`V@<c`!Fb;hd3V{?>a-uB!jo5k1j-%b|pqnBldPE9?>@`g4vEKVyxBs;hp!qD{
zA8GbVb^XpeNf!wO@44asc)?o+b~>*&92^`1u~}A3KDC>^ex+nV<d&OV{;1!-N{1+R
zJy;WzDft!fvAxsV$Gwcv2f%3a|1dWKr!z(P0c!{|yE{9>bT%%pIjPP$KQl2+9a#ze
zhUrFUmlrEn(a>PdyU<Z3Hw=}@Tfgy%Q95OaIl|V8eBC>Bb#D=x!3vmyW^<em?{zgj
z3Ag1gD1*{0JS^{XyH5wh3guw4Y0)!*o8k=TKrS*mvh!4obb2YA3Bv8|KUHtX5C(Kc
zrS9%4Xqv8P8$wLbVZfJNS7%4!jw^?B__%LK0oMvFam4c*(K$L{7rZW*ZWVGZtBA(-
zWl$>2WH%(Ke||pR@iXj|g^@oip9L~wV|vlw#Tw)9e_rMOu7CQx0%}8ebhYGZ<e4(P
zBWpoG9P@X;1Wx*dypSV%Ci4U-8bV-4L^<JRAY!BJ7=+kc1j!s`Q}XoVx@Y<W$^|Jy
zZr~YSDGDx$Xt75a3Kwt4rfveAOaF4cWtSvT0IgXFCJCqA@Rd2nz_^45yJvh+&||Y!
z$fG3lePW=f27fbB4}H&G#>Qw&g*W_;TBbS*9muDDb79XD!I{Cu<~Lkua*+f3Ix>-d
zGPusiK~IjknZO|h%?Q?p59@KSBx{(O^T4Aq{cAqKK|o{XXg+7^>r}W@q*&a}W?63c
z9WBrt{~T{`Cj%AQ4XV-afai_}K&1-MlK8-Vnq@d8;_+$$sW)}p^$Q1wkzI`5lTZj<
zW6m!Lzm5l=-M0)qHsAo}M(2qdWlhb`fC}k*0vgCGj<=Z@5d{OIy1F`^7<&-qwbyQt
z*xapp*XiGRKUX&Rz74|v<Svw@znp(-)l;4P0#Z0?%t1d!4qWrExsY-=cNhn!Q!u3R
zl)`(u3mv5xvoIC+`O7~_6y$}hpx>d)5r_&q-@fUgqIYHG071h<gy)JnIx=~<o77_p
z(cazNO+rsb)25K;WBuS(6pxB*9);ds;hFL3N@Lv<^Mws%aLUGOgcaN1Pe*CYLu)}E
zgQK$zQSONHWX-k5?HuB##0>H8!GJqdgf7S;OvBkuHu=jMP7{s28hbMaI|e_|blNGl
z;o)EQOnG#7_63+N@89p9a)xLr%{|*t1s>34yt2o^?%oz$uJ_ZIk@Pt53>^-1N>U#7
zK^5!)ATsTV8cv`N>Frp1y9XXaU;#NAIry1msT{TMw@R|NwIzxMGLR@*qAnxfbhpUD
zN5dHiEXW8)$GnEF@~4S=wc!FxFBH|I%x*^Kl#IgXmZbPObCD%P-m@8{XB<W+S%L)|
zGJytE5^%ZAl%k&s{rfmQSb_y#lJ9#XCGbUVQNG<TT8j-+fSG@_k!NVYFM|T<ZrhXp
zNDtTZ=fk$wtDbT4bY}$?Vw)rkfk))r%>3&R$Mo(884&lIH--wE9fC%H1akuSMA(P^
zg;NjnD0i4~px?g(iVbIp0S3R_MQSE?LFnLx`xhAN8u)<YbBp<jJ7<w0G7<BIyGQGn
zD8NUT(?u6}go~w_;x&rk^1Ou!%J6Tu`cjDA;gz_ZhSv7xO#T=beIxnDpO<!^(rZ2^
zIDoRC9qR)HoAPm8Rn^oY^bxRCU&pG{NKz#d;N(%mp-MHHupJEh4Q($<1!hvg^a5eu
zncf$vLfThPgR+2^&%+ZF@tb6Ik-!20bsa`zg(G?~f3L1=jZx2#fw}d1@1)Sh;c`pg
zq>gyTMkSqEy=0=VpH&lciv%bHEZ=q8+t{c$BSN&GBsAS<2<MR)e*y6WwaUCA3%!H?
zuqZU(=Jx)oXlrY0-V_^3*qsK<+aT}XM@&Y?INe1b2UMHD!Y@G;0#3fqfbv%NWVOYZ
zm09w4j=gAry~FiU!U~UWOH0cv@di+bM%<gQ7`O_7to{acmsWt6Z89bEfNx>%2HY3-
z=;>+s%I`fQj13f^rt!!wFg*d#M5sFlXamv^LKjb<h;!P^;YB6^NC@O!`=D-m7fP+Z
z1mw_1P|r952n3o(LH)wZYkmyzIilK2_&`lvzC_k2e%2ulRHBR{=p4yNU-|U*!|!SG
zxZZzrE9U~_f=4^8*1MrV#bNy4p0*022TQ^;R4``uq){PJXDY9|+3|Zffce3Ujg1ws
ziq#wTa)9~NG6TR5FGZn8^A+K72FySPf(nrI-A&BQ%s!9D@gVY+bnrc*>zOtpIc#LM
zUrh~*bzn(mW@b3<mKMs~3zfM+lnliN#5uFXk+gu22ewi8irI9JLkRcd0`GW><K6jo
zIBwQdD8T(#4yb-;vk@}FSIa4FkjGbR9QnJkHXr)LHhS!0P><T@FORx|dC<ZLC|n40
zMWKL*2S$QppH7kzZk0qyNvSi4RIntokblu^Ey`JXwf|_aEFPtAlPj6zE1{+Ka@r9u
zP?pJ($6U|`xAWxo{J5|vF$wGo)Q-!yPX>W-o?_>Gbve(?F#vEXG50&VsQ-A@f?H$m
z*o_)tffuL&gZ6qvkjIm}-$(8l_fHQN)@Fp)WP2%N(~6`<8@IYXQhi{jDJpLGm=&hg
z5Tu$3n(K2-z7ci=|A=w{^fDh*RaLL8MF^bFw*qV8vdIC-(>cKMhY#HD4eE{yZN$gN
zBjQncrO*~dcMQNOpNYq=yVaLzy^BWPCLeg68JCcNciv3G<MQM9Jy5tY-q-AO^)Y)w
z?-?>xb4)ahpfIMea1{zsu2`h&dP*@6U>DP~bc4-sogfFn16^GJc_y$X4c5Ey^bV+`
zc#Y3o$id>@07ABi@3=05kUC6@htgb{(ACuyGKSOgd5`vehlgG~yp64`FY^XaU(0yu
zjLQaNfY$#a2PmS?8I&P5^gw|zzU~FU$ZR0H-Ad5w(4t&>2M95kU(=Wz{=)ObIb!@p
z<Z6os&gG~Nj8Fz`PYng1N8R$%N2VHM`R!wBWV1TRfTmz2TSb&WEwZ?{xYl14K*OV>
zeq5}QLH3xWWq5-HaRgVS72amDu2)DZLPEYk-HVDyI4M7aB)Qw)=g)xj2=a@QjxJ2Q
z0lhs~T06UD%fz?nh1k|ow43&(JKy__$A39(?ahyc7mj5@?e{YvwF@gYB}J+X0+fEq
zj!tO2AekRIv{<5X|G|Nx4)i3-X_2tdx;;QIWDAS*5g1Sp9v(s$S#}8X3cSRJ{jogf
z+lr#!4l6QdEyVe_NZUZ%WwkB-qmB_o<7Z)#@+wFdfAfnap_t#99x0ixukW=r{~J@*
zjI-bj0IST$UDyCn-yJJMJUqPX3(xg65C<7RHZ$)6Qkd_o;m>64j|Bw<9}WX_yslto
zF8Elp=5l4ajj7vKHG}Tq@Gd<70ZpPj#Wa&Fym|QMUN;bLyh<lPq<gh1k<rk=9)5w2
z{v(@8$Ltv25*yrxcaU-5bDxpQ4;x5rQ>KlVSu|y9aKAmlai{zOc_vl7Zt~RwllJ!Z
z4i7)vBfqgO_WIJx48#s|yk+VAiYkvr`C)|w2Y6Vgvi@r~1@d`E_cY%2Kt*okEC~Wu
zR|}K@1Qy*XDRamuuCAWe=w?QIQ8ty@7g~o>E?yGm<{LJ8`&=C#AAj$zF05mejN=;z
z_o5&L!uQa7=y1UqlQy>S4Gs-WaiGjhPDX0Zg@j11g<*4`T=BOk5Xr9Dz>=8tH*SH@
z<n7iweJR3_N5wyIRUAS);c6xU48Y?KxUlcGkA^!vaY5%vPVd!uD-S7*!~;?T2oB*I
zk%HEwv=JCmFdVaJE`h{sXFjbk%}hmi15oonT)svt1FQAT)eO|1m0j)LWM2x$JnEX!
z#PODX5#OKBbXnj~A;08OO^dre5x%Q(J8X8Ju|>p*lUvC~5bpZ4S=&Il`65fLndBHN
z@BKJ%v=?{Xpt$g8K$KU0a-p2nDBbYr*rIBbJNs>l<6nvK1@dCTpcLL4bhMbbg9ep2
zT2012pX-l7@oJd|J9Cb{6Ow860r&R_blR=`x3~5Ca2$P2F}lkH6IHkMOS}NIU>iB7
zRr6W&-9wf0EF@q_Z~i%5>e-60Opq}XTq-5@GwOnC<se&8z5VZyjsK8qt*Ig26ig7L
zA|Wje6&-oyl&sP1sS)^}0KFVe?i~tf(J=elXy8f$*+&5O)Jy{s(t+V~RAq+1zTE#Q
z1FUVL)Wus^h}4#&n;~LiY~6D!tt_ZzJYIfN;I`+cQS9dgl&B@<*QKdwYO=^@#l*z;
z9>e$8xsc}2R!y4qpeem)cbz&vp9(9{OiDBOUak7fe4{81V9+aqyklrhC(evjxqsHk
ziowrnvG?B(A9vpEr~Nf?wo4)~J~uHE6<5cv>#=YYWgKx<6kFYEZeA(Z=+)-kI$jRn
z(p+g&n&?U~I0Z=PN^d|7keI4hkBd%rU2cMggS#r7yrLg~CWvcP%;i?>DCs=H-`Gqx
zH+n>9ZCe9W9B$bC0&4q?Od~r#J>9khLnOykgPfeP1s(K4@ZBY{Bd0F9IZ)a}LVj+}
zPgA9@m4LrUj5XE_baZJIAy>JI9|kGx&WMd%oZ7yl@;lW3r9Rhe<Pa`PvH(cB+gm{V
zZiKx<ZkEnN#?6k>oeEubKsl2NT7f?Ul_9Oj%IUdRAL8p@BJp<K=kIKx0<XVe1RAtv
zw`#2e@V+v7;K=OuchwL9#3hKIzTAdg^3OnYC{V&TC2>f!!3vb5IJkl1Mh6Ec4_c?_
zQ#Dmpf7(T44NY?%DS=8Vcv*KEKmV~XCbS3!k1|={c8yJ1WA6Ix^Vpu-iU(Pg<+>q}
zD3=aq#W8RL|HUBxH{2I?_Mdj@4K3x-kg5@&l5~XGVgO&?ril)e8Bj4Ini)`8u(|Yb
z(i9{r`9+2XZ?OgSTa4J|lWl@p?KJ`MTK|tSh2(NrCOEx-`vT+4)q*!|-hi*NzK3z+
z9j*Rh=BFP{vGM%$P%uW&$Vh=O9OvG=gH;9=JRZrP5n7<;w(IR~30QAdNPJBnBgbxN
z8szi2w?bv>{1!b35*Q2wcT<>Mb57Z~1dY{S0hw%T0N}+<ThTBhFlR<Mr%@7=;o;#m
zgk;mS+1MI>e<Z7zSBcVRnD=`>x2dxU{VeBT^|uG@N`6lA+65W{pbZbRj|7_w<W=ag
zqCwN!1q97dhrrtuQmEu7t>@N?G`$}rSqRlfLZFpWT+jV47x)!;z<&=(BH?w5-;@Ou
zTGlC5d*4rq#{j^%v?+jACFHN9v~<#DSVbs|FLKEoie^&){qpiMvFn8PsIzL}zz08s
zci8<2Nlc9Ak4=YX6Gz_@>`Gt*AqRP-flhrenT#)W7|&AlX{i5CHD?+QW%&2~LfIMn
z(u6@IWsD`%6l2g3LWE?pgrw}t*tappl6{So$(n2xF_bWt5Gf&B_9fdO$&&7K`al2Y
z_5JpKJI5T?oO500`MZA0_xlkQ%laIaZZtWCTA?OK)(7>PP1_^V7-u4Xm$c|@9a6X-
zY5As(w2Yql^DAi_OOZG1bFXb})LHS-g9ERdtr!c${vxEqf<ZQS>R906f&Z6%Eiq1P
zBcu<s47`H4jq$DvQHt@`P`ulp4lWtgin^shSNCAPr>`gQX6S0SX0f%OPWS+!Z8M%3
zSHRYoha%6~;}@be(iEL~vqFmx4uZC3U}FPO<H8lJiJWCRlYZgVEk7-TRGIBckgt*u
z4R49Ix%LFnHQfY%xOIFaeOr<wdqH!H-E)u>&tFB{SVsuWH}0%-^_`^SZfFzvk0X?%
zUydONl0pL1QXH}t6Bg}=XX$)^DeSIJbing6MHxv8w$Spfnq{k&?VY5MHt-vb{RPXP
zL+s1gmM&z<bAzK_X_F^T*6zO)>-w2MIR52o^KU!SC7$uzZi`g|Hg+p)Y6ZbW&GYon
z%M}^l#UszuwYN1&5d>RXztfL@0~K(Q3P*nHcQ)%H3x2lHjz5oQ*OWn|tuax$&~T~a
zlg-xli-9+mJR5$*!3m1dyUVFwgJT*!icrfvVgI~*eyuI@z^3>a9G~R7U9-W=`NGiG
z1{`BhgN6!IV6NoFfe!tPEch+`Aq}JB*!M(7Z7J?}>->g+)l+MZOq<RAOq&=Bl~UI@
zm(Qd9;(QJlr6-nee4g>FaQLt$)utGh1iQe~$L;)!8U(VVk4_IaQ1L?w`94T+)Fmw5
z!t^f6)m}j`bU#aRE_U;J_322?n~H2#Xa->>md5I^6H27u(iMZPNOX6_N2bZ~Y_C<N
zK3_>t-M)E*Jtk^A*0$_*ui!*hM&>{dS8R_$#j9Z+F@lYkfezuOwO8s7OXvH8nT1W2
zmK=*6L*`w#Rc;nKdf&`@du=Uu+7y`m-_fzYab@i=^x{EjlZtNGG*(sF>a|OF2PY`0
z7Ts1VuM=UsN)TLI7+~RMr8S&Sf<?*JYD)}=$2_GoF8%TQtv>lp+p<vwFZM@T#lDL|
zX~dljl{=e<Ko&JFHyTb~@9Ba3DNH_vW_zo!ly~|x0Z7g<L6M{QeG4t4<Pz`u`O|#k
z326^M-04&nHz0G?V8+Xmd&-uEBS4bA49wSV?g@Mo4SsMbE>p=f#(sgjzCt8R!`-U*
z)kQ;tcY=GTjQ!j}T}d;-9_x~&;16)xM#-J0a*G@t3ks)Fc;_9vljDt!c6S0*)+T?w
z8lUUuV9&Ns>sM6^rFqenz(V@&NKB5OY{Z3IW0{cY<A4Gn^5Rjr&pP)}sXf{Jk{9(q
z&Pau*3|##R6i|3AuzI>Skmj7@1+(FpoS=0sG?+h|T^Y!PaDz24L-&GOmrtTANYmyt
z^_Xf?QqnLmpuR_de2i5Gi%Kpl`Tf;M)J$a{6~cW2*hy984~g1g>33;LSeCf&Y}-aY
znt!;Jd-Z4z;}ngEsL*uxS?I^@Kf|!D#DJ0u`61O|a~VJ;-xKA_%nZOd+!idXtPeIy
zobUSZ2{j3JRsM(w(59m!p1xkA7wqg@DpY+HlSEs>CXm8eY1o83_ABX=#ph!UGcq&L
z3`Rm3HG9CD=)(&GMm7wc0U+$0V_S68ANg#ktB_{CE}|XG3wfWAz@ZpgHnOhtLjM{Q
zxLVk&>T0f+y;E4vjG~sG(1MZ<fC(}^YU&FD*Rl)*cx)uAY#erg23ya~&5elptqtjh
zTQke}Av1DvTq@Yr)YbdO3h{#At!iUoWu+(~oxGp~hxeIDrkR;4*Rdp-1A%LM%~(TC
zZZ1>?4$rKuJ#T4YQI#hMYX(e}&%%<w2#lu2)#Hx^%Rs#s=-PFxE7G$*T_xG~$AF9?
zVvhzllGeopfCuc{4Tb~gqHA^E`k!4f$fw++0wV{YBxNW4iPAo$aNyo=mi24Yh$HO^
zTvS{O#B(^Uh#GzNEm`79PrwsZj~1UM1@B_Ab}@H~D_HPIIHKy2@Q$mN{<%7z<&65t
zRREVLSJVWxS#QFY$>UbjKDFm;bKaZ4_UYB|&eTj5G{|%PdqKB)7HDthhfDL`n5lT@
zPmkaWWC7Xe2H*nublf5Xq>;0mn~HQ!M;GY6Ly<W7*$c(pXB^x;o6TONIMj)*m1WY;
zY3`E35uZW7C&xN(Z<kzeQ2xFVoy)jxtj;epF*r0-{_G!M0MLm*amtan*b>F+s50&P
z9{Cn1-U+uj3EOm6MBjSyRRYsnW#!cpwmDS&^c+xY6fG>Q@IO>qIs|vi<o0b*PbB&A
zMl%XSMuA&M-+u5@Kt=ot56aKauhS<TmQ?8C-euO~>r#iUJ0g@O!3D<okA_TUO8Y-o
z!`w=-3BV!+S~a?$fh2j(!qSr2-}XD`zk-RKdoaVd#T_GGN!iid*nZ#rys^N|cC*<Q
zp@a^9RnZ}jhRbVl`_lBc1Vq^Z#%Yk>FISWyE-ntVw?MrB(`Eg6+Q>UyidEl)Q#!Uw
z>|Wa`r;oZDn5Wi5V>0aL#^*yf-0pWAx=$Cg?KJ;sjF@m>b4y90u{eVI0H%sa1Z8*E
zNGcMNOXpTvayJk$t|eFzy*#~#r9X-ZFyfM4Nd5O^PV(*mtMCkApPlYzRfw3v=wjUQ
z4m(wmg{gyahV~T|8Y-weK`jAa02)`*fj^l{;PDQ&c@kt5gyqR*>8zb0pvXL=L4lg)
z8NR-C*Z(FaX-#7WL{dYyJ==pc3vNq%pzjm-f*4Tb%&ZH8G=bav&Jp-OLl9rCe-r(w
zdw@H{7tn)?y8tfNs=yW~F3Za$vnSQcoO&Az|8p@Q)wgTP;u=Gx^nEQG&GrB;kMjSA
zhfxkNd7z`R#%ZB@`;yn2J5zXCKDMD8pyCWpcul$_57KG7XXAkRAJ1h-tgk2lVPC_N
z67<syMg8xm2Zw*G6ciLzGPi&Qr2LYk(B$rOr-us(3)lXkeBNEToy5P)pE4W1P?o2h
zckv%_<#!%U5e2_H+xyeRbJ?4&&#ccNcERu;waED>|ArZS351H>U#mGa(UNq?Ye@6$
zc(vlx0uT&S_{I91e1H8)!C3U4EISKaatkGuNl((#PXW?O^{;>26Wx)p%-XfL&<oxe
z*YEE>iX~b{APZ>uiI-^~Z(pXU5RDCz^4iYcUgA#vZ3|o5{Q8>|(BXLT3?oU+P5LIS
zuC6|-HeElx%S|In>5gnH55em}@!uH-CAbdIC}(?nWFN`?X0PTgHP6}31gD`-pKLCh
zYkuYfyU%KVetz~~ck3c{g-E2lK2qQo2u2__nZcTGxnQwv$y3`)$)qk&4u4$0{KGsr
z_qDWWcIvSjMoODnTR-q+uP86KbSjjlwX&9D_I@mLUtsU+W@SCa^YS(=7~%lW2hg1A
z-W~X$UrXNTt1K^12eI!uG7sr5?l#ew3@B&I_a+$T&}zomv=ehzE*XgqbeF&DniQJ0
zINq5g2Jl?r^e8bf&`tr$^`xkK_R2(-2v2~D(dT5ndd2osbaOKba5>}~_@*ApojaG^
zLgx_xuxV;i(doOuZ*%W>X$eC0|KqH{hNn@g0s(W(KX{CBr#09kG>v{PM#|SP@^}6r
zjsquBrw&8WULBlTHUR-6`pSg0W)QT^H>eFKFZ$}Ak(D)oX$NO_q$h#4H@@!3I+w@<
z=)fzTKmSN1?eh2DZUV!|BENRMamYaAb#bN`z>`Q4Y@Q9qB{RJQ-NnM5o*r5)Eu;E;
zl-oXq_+D%1l=uyp9+*KnsyG4^#L{EiSjGt7fqN(Z>+Y!1H!(I&mT9Tus4zD+w#AC>
zgbR#*|L!&+I;Y`pB$t+`dz=Z#@cu7@1~CkvEi4I!<(t1&t#%LpG}QR)9PDj(H_nfY
zJbF=C*$t>G;J~KSpo)@ge-E}22flv&@b{qaFUHrm7DxyUfaSYd_Gqgb2(6#T$IpQ#
zcP4mhG}0e9>sD8iOu<INC&|<JgCN0}Q~$fAKG*bjziF=NaJfkm4!^dyzdr{U0E5O>
z2M4>?!F*606j@3;C=8!^$Uzd=WT2-lUzvYaLIN$K9&-Prwh1$h<Jck(=m-Js5IJH#
zHw9epZz>oGEG;jm0(u6<%q)Fr^|6|lj^5R)bAWJGGz1Qx7&zXZ+ds_Iycdl+eQY4#
zl9RcXUH|*vczAeHva{>a6zY1@-@{Sfw$Q)(--}BAbc7y6@7~`2D-Q*~vEMY0=yiGT
z-UHrq<qd5djfS`<Pt=1`9`-$%+kfK*%eyNcrV{5eBXaxvdHp^W=ptP^?o2|oA9Tqg
zY%}D1f^xTOu0ZLi(Dokn@U2>}aDu4E*hMIfM9JI=dWUlW9$2B7!4xS->Q=rXCJcOr
zckX+e{%~<Ad{Lk!mzJ*UW&aGRgg?<zV-8deb4x2P#_l~xXPFsUhz~TqT_^UYp}}GI
ztL*M7#G3du&Z)0pdqlZZ9y$G}OHW7%IiI+^JjgXVIaW+~^Kdic1lGIWBk1b&RAhGE
z`Ss;lTJzEmXVIIBlo?-Led)~fIyFiFUQk}x7Q|7v(>eL{o7qYDf7S|6aZvS;F%d=m
z*Uc{Y9U<8`9e+79Q;eYw;g0A9$&Obq^)Gr(hRrU_V!Y6iFB(JMy1==xH~p?e^8$q7
zujWY46{_tA#fq{uM&kgRGy$vxUTDYvPLRAtTB0y*j7A@+`Yv>*m%Mp{clA%;P62fo
z@j;>Dq342d$JF0z{Jfp-A7Au+EvLmvXBoIbf+{1o^k>viN=?o)uj~Hi!bY4PD$F@J
zb(gkis@Wctvm}V5&zG4SxG9K$&;j8-u3!3z{w}vO^*ombXoyQJyCz!(?3&04=J8VK
zr@w^m*Xo~G=oK6US((i7Ve^o^*K9%)Qe^R&sp6^Zn(uYCtbCOF_dHD;*{^X-WOEmZ
zqup<^RflK(cJ%rBlj_O7UOzK$;J-H;vs9BOdrtY->u&12Sj3TOg4ea#`9~3~u-2NX
z@aZ5X89ZN)dZ^qfo#2Fn?|-v*kSpQ@Y7+dhI=o)Ta;oOt&6_C#US6K1jbpqswlhMM
zEn`q?;UNN4ZZ{R|eAbOADaRNEhH0CFv)td=Y|F|jGFl0$PcK45NZdk4u05FFuvZKG
zktX8^k&DllS^p@*axdrdjcC^!L~gvh_ubQX3{NF!56$?X8K#c5><8G5t>?osAbA1L
zI0D`*zHRXPxGKP2-GT$pW}0PvQ^)I-CALj^hHPGW3$Z+CWaTn6=MBPRm`{66b)O93
z6``)BTWjd-kLMbf#GVeZ!FQK4;e&&K-@^=}9P5$pQEtq-^HAVS<glSIiJKW0w#af;
z9((vZR7K2UODEgS&nMe1V$B5S{ET4E*vF9vW%yYLE07=zqo|)A#CU+oD+Bv@xnSQH
z?JJBVMWnn<Lbq**WJOFh5{DyKUCw)?(9L>{f8oVhc#eG{1he85QDM%6pg`wP0t=)m
z=4VhUbesaob1=r{<*FcUmCbohg+b6&l_xqnW=>wGE%GS7u(()yNweg|%a;lio-g5@
z-nBK^n#U61CZ>gS3r|n*Va4$bzB7A1Uszq9S7xIB9==iI@Ed>>Z&V}v9}sVTh~X&`
zGl);LGXHk6gpq93Z!mHX7k-+R!aZ@P8irl$_1+9}?ftn~B`RJLhKuGw6VLvLP-tZh
zI-ur{DN;luViO6BJL^_g+ClvY(S&Na%iXGj++ahLYi5szjQ_N6JqfZHzVkfn5xUfu
z(N*J03<m2W4;hf}ySx_kxwI!)8@2T>h7F^<CkvZdZ&_PbUsA)}T#Oh$_nR1&8SQ~$
zn0m@)^P`!5D`au+R^a~NSWzTGGmROg(U*6*rdEd^eT3_h^BAKK{&b53rJ6kxo@3p;
z@o&#DcA{fXn-mL*PtLvEAhl`j0*Ov`>e>l*RP&wvXM_c>Vcb-!m}@Z`=dq63*RMOl
zn>k)cWY`DYBOi0SNopl*L*dEe$2DsrEaW|5uz}hjs52W+wK%NP^zOru#Vjl<a=P-)
zIAbO)8RbT_cjX#Ck%xhECSmbWlqwyQBn7e)RIHtK2HV@0!&RutiBgTl*b$v2vrLY1
z;eV4Fc#{jM7-MyY6$<D!fjifDp5dsFeVPS|H}T{}$Anee%TV&6eDjG3#>R6XCz%)?
zmN!^!t(L!!-hpA)w%X&GC=h9DHiUmDQh!IXf|JwGpRl2SrepX7Nft(=vU!BY@1iv1
zYkw!sIcTbWdKh!J@7S}ThNB`<5rJYlCm%e3<z;WOP34pQ30bmCeGmtnEwM&CSMbmt
z8A?3&BfRsbcdOlZGHk6*r7J9;VO;iK(D$fnY=m-a$L@w<s@SO!1al(8gf-!*#$ro&
zC#FZD(GKSec)Udzx&r^m%+lMU6Gb9;(wCu87acp&=+<hE%HZH*8>}eZefjfDli9X(
z$lj<dn+uv|+HHfwxq~NTWw@y?AW>>a)w>VInel?*vVucjw1sxi1JVp9lJmP}OiK`G
z?^d~UayPBsgbO~4<Nbp6?o-MY6xZXOiCPqCQ{tWrr+dLb7k*a0qBt<SAJiS1M0y-y
zk&HKzsf6e@93|-|ryu`jFJ?zwY>65EQhe>BYk$+>UU%aJKyTKc#EQ2|rVF+xYN^~)
zg?LB!`*p<c+j)|$YWbPqczRNVfAkqKM(ZS10qdvsgh{*5RM@Ou*3k;TSA}i7icD)K
zTD!d>E@(1cjf?H^$9LZlV`F&!XWqc8k>k3|SZ~x2Q*~6w`H-E88Xs2TnTX&j&b-3Q
zA0=}I?a0T;2{6LW!-XRC(4btKHHpS499d5W#Qy0cEyeA>#0Z$ihXRTkX);<yt7wHa
z_vEL3Y*QvYzhHUW1eHiI_&IjXI0lAS_&gh!8|iA`t*ki!Q7+w#YWZ}DDH*?$o|%4X
zhpqqmTwB)6cDv4(WwgpEGCzW_Fq=MAZL1IOpo()<ZH-V9zHW0-B5ec<E=FcrdTo%F
z9HvDUE0iR(x3=cKjpYU-*?4xt&(-Q&n#yk3Z>?A5$4afmEt3+O;vcZgLbZqFDG=+n
zGvm<SWtB#U0cM8)7hLUp@WcJ#@#1!6<7f*2(E<;IAxG?p&aqFol(2`-WjRptn8tDn
zr0jZ~PkM`0y#wwpl_gyeOZNWov$Kj*vy=jvNxdp}ox@u`{pm+)3gix5C8G$GfsSVi
zCJzalY4`Px(-icUe*#&6J!73etoNxQ={p|L_o&W}W&axm0z)f4lqlb*G6vWIy+V0#
zkOQSH(nUE%ds<hqEj*7|ry5OFPYGw8P7JQQjEBrcn3pDQOwrR{*MnHlBeas($U0vc
z_RY{nWe;C24x!D@;e{sPTK&6FaZtJ9A&eGWbXaKP1tt-ac6#wKuIqWQU-te*?s>2j
zcUe@FU`rgu$L2wM95x0vs5a1Wt~Fdn6m#kL(FmqtN1_acHFe3%oW#-IFJ=lU&r9HF
zkTVqf4N>iJ!V9pt8I04@dDT?(in!o$6UuARGn!o_%czYp)6e&ziI~BAt*Mdnt!1r<
zT>=h8kq^JkI9^!O-VupCj;jsmHBLLm+zksm&3Ks!@-fzfg2O}pz1pGx{ooOau^BBT
ztn65_Als%Ciy6<M{)&yyRK!C%E(5{ESOTV70iByB2&5Z|^O-7S(P}-0m+v(M*MSBD
z3&Eo}CHqn4OX<(gco~Yc{~?8IK=p54ndBhL^&g9C%<nZrOnzuyrqn&ofkk{(dl%!C
z)XpA$p(Ij-`i#CgFL0Bh&+@b)x>S7e!dH|4qBcj!C*Gb4{aG>ipAEuFEdo%&e)Jug
z&9s(=qkU`$O@Y%HI8Rnb<4GKpwfalqV+HKQz3SUNPC=y()-imyPS6Q=$BFWML+o%w
zlw9*C9;fg*a7e!lL|wWH00p#sUQAf&JGE%?n}d^6cW|qfiFN!GS$NzC`{bLMs=8Z1
z9K`Z0G@j|p9U}YtKa-Dbp`7FKf|;##V&DFgydOcJR2Dy^N`G9_Ckiwoae<5H+v;wp
z8dH4ZPqjd7Ue(pzO@N*8X!B-gvPF`F;dLrE;xt4|^wIB!#mSdG82(G+j`dtzSzMIw
z*yRvG-u3m+6azB+9&eW{*Z$E_mlINp_7_cRV0Vvql$HwrhJSu-J01M8fo00WuI1t&
z-^$WT8Wzp;<b<Z7@4pH~Fw7lRDW%0W6FrCV%E)vw%<33^@<l9YI2wT>-o1W3b%~jj
z!`uIS|JW=)sU*G*Gz0;?rdd#oj6sNc`1pK{m-kUzX+>mlbGhyv+W=aN{}q!yq4O`J
YP8#Fo`lzlNz|KFSt8J)Np=lHGKNE;7S^xk5

literal 0
HcmV?d00001

diff --git a/notes/Leetcode 题解 - 动态规划.md b/notes/Leetcode 题解 - 动态规划.md
index 1b36b521..a0a50a4a 100644
--- a/notes/Leetcode 题解 - 动态规划.md	
+++ b/notes/Leetcode 题解 - 动态规划.md	
@@ -1002,8 +1002,7 @@ public int combinationSum4(int[] nums, int target) {
 
 题目描述：交易之后需要有一天的冷却时间。
 
-<div align="center"> <img src="pics/83acbb02-872a-4178-b22a-c89c3cb60263.jpg" width="300px"> </div><br>
-
+<div align="center"> <img src="pics/ffd96b99-8009-487c-8e98-11c9d44ef14f.png" width="300px"> </div><br>
 
 ```java
 public int maxProfit(int[] prices) {
diff --git a/notes/pics/ffd96b99-8009-487c-8e98-11c9d44ef14f.png b/notes/pics/ffd96b99-8009-487c-8e98-11c9d44ef14f.png
new file mode 100644
index 0000000000000000000000000000000000000000..b01c1ca0e8f921f79d13747e16a43ee6ff98a843
GIT binary patch
literal 24454
zcmd43Wl&sE(>0m|4?}PmoB;wPBsjr!a0%`XAtboFy9IZ5cXxMpm*7rthulM+=Y8wm
zTlM|_eoz!M=j`2EyL+wG1j>9BL3xY+_SLIbC}N_5a<5*!?gD<A5aEGO+HRh$fM2hz
z<wOKtm5vhb1Ao98@=Ni*dQ}mI{HO~D{EcKGs%rh}70&yYpVwk?6sNCVX%mPE@+&xK
z9jELoV~N#Wt^K{eo7BFSSj$LrE_?fyni28s$G4fFK~gemMj9qEuT0WRFH*0}%nhH~
z-I0`U6tZHou!;)bx1URFmFn1qDX<$Z1e4j${`#N^AR@70K?M*Yp8k5Gh!BcX84wc0
z2bMSp0`UoNhcZz3pkX*r`vDKWLG1}g6A=BK0mcAc;`+b;CA)z#?Y6C@I`i}WDJoTU
z^{BZr?V+JKy6uH3Lq;Yha#RwY=(96RJYwS5)>fVd*N0lryLW>tP4)(QdIH4UP83yD
zRp%Q$$c|SBG0lz_!aOdwqyz*6=bL?~cTW#>wp0S5mB3_dboPajY~Nk%GJg3&nUaz+
zIXz9GsHkYQGmJMdG!zB(e>dO>gAi%9u&^Mfq48;Zd)sPz5WB&0)9*tunq0u2u{7Qi
z3`~LRH$CC7I1bvU{ghNxIYmVhMn*<kTLV#%5fSSjCADgnmo*CV^TXBa%m${Xqnq9T
zt`<Td6iU>76!hs!mb$tfSgn(ja>}}aJ-@MWu(0|8gK{b>CojRq#>P@(B^enVmt;vv
zNjWt&ii?Yj*;!d#&4%{&bstndfBrl<KTjP;ryU!NOP4su?-&#mBw2>J`dbSQZ;r3w
zWVu1#u4~epf`SnX8adnk0FBer)J*w+X4bi0Jv=NaA5Ut7#)9~^Sp@Mzqx4Pi$cU8V
z%}I)*wu1{43e7DS5S9JnP{Gd5UTSNB5BqquP_@I->T;*I;)#}-4vwteOmlyZKtLsq
zPnBgxJ?xJlw>nv7Z*aWG{or7})>>1#L4wxp%|{qws%L_(ccP?h;6Qo$Ese{ulaxr{
z6EJ+!+sC`A%gf9D3jIC}p;vbImp_>h;U<y;RwYFk+WXo!HZt)V-cAH>aqsNzO1QhX
zxjfy^a3qE62ry8z?mpc7nOt2Zo<;6PCegyo<%Pu#An&CQBj!H15BV+C$(c(Xnf~%1
zy!G{R@0$vgP1lQyi`fX+c4L?O%L4Wjhuc%#xn1}$j6QS>3TnUZI2}EXTue6Yol}e7
zaAdbWg79OAfv*dTitHU`^1h}pdfOu+y~ToVaMCNbFRa*~{^l<zD`Tzd2*2%E7TmSL
zgvEtm#D$ac0bRa95C2LBuc{mV%l8Py=9eB11<$9;T~2y>9U^|w`xm2Lqo>~o<72Kd
z{0*hR*-{o7kDv_*n0!x>0&GidkFB{zG(AaV%mXniK7|h$sC!;)jEs86?<t<r!5CxS
zXP>zBE^p5^zXSIaE!bViiS24Rq6c1{8Bt6G7{~=FG{gx4#q#FTwrK0{4@m8P^>>W)
zePpN%C@_zIugwXa+~WJsp971~YvgYS6WrF{Y9JIVFD-jHTBxLow)jM3CuYMJALc*5
zE02l6Hb#Z)zwQZl!1)#@OQ-GNt6>VU)lqa0nJH{T*s;Ng{0g*d_<@F|O1pKgRI{o!
zQo(aOZF&tR!7YB<KN}O6GBMx)>a;m9<aDC)GX+$4UwR+Tl@0kK<8E~aV(zFAWYWu`
zKH~oEwL9vwWLu>}PgEgQ8GD2oO9{8})Dz_jToqE&&@eH*!inE?`1|Z?-Q$!^E5E(+
zYu!ZyVeaDmQS6gV@nFam8Il+-F#f1^V>vp_0G~JyDt|Ne?X&lb7MdDs!NlY^yh__X
zaT219z#64)0o(an0{4!wrM<J$YkGQme%ngTOe;ep-z<FR`t?4ME1CWj4P(uz>i1Yy
z1H0|GJMBk;r3#Y1b%*3#J8tla|AP~pP0Yb|7nh*G<m({F8O42c5O5k))a7B6#{Khh
zgFPxU<qfk7O2)9*5LeAmb~icdQ<q#V+@rgY_hfUdt*vL31Rha<nZ<Ag(Z<lo>42ou
zEJ{JdEA8FL%DPKM>y7oT7pc?;gHcA8A$+1ie4-pLmJ8y(9=4Q#yRXlwJeRO#y#KMF
z*o|RYk9xBE31%=xyj;BX<Ivt-eoYLTJKzOU1yR4gTzWOO?zgvRS<!KEOE>=8*jQp?
z{rbui;<Z;Hl1VpnL*C~Z$px?U>kA3%%-3pbF*eL!W^!*O8*y=-PDxpL#L?qmwOm5E
zbb+6~fN_~*dwj^(Dzo`P%Fr-R)9?A&&6o!A?Dw)*JYR2~9_)>ctvt*3Byc*^IQ%tw
zJ}CN~?`=aJZ`9G278j2mP*G9U)sfCvU-ri354lgwNhagldzXk!ez_WOA7=cl_O}Ha
zZmNc=Yied%Suq?iBi{j=jA~$PtWLZBfgz`zT{yte!%Scc8+vznp85FT%QNy#Pp@-P
zJfICYLDHGdKmV+@RMk=<7*6Laa|`6Lb9X-lG0tR(<>lrUm-yTgysVeusEIU>JK!T~
zSk81-QyWo-jrDydhS~k<NiNWeii(aOMuvw~{>RR6ShW_5sF-col`^OFcbP0JuziQQ
zA_<v111Czeyb8_HA49`i{;dy5oVb#5vK#8~ro`1{;0pd=$rx0yB{GoMGB~FeQ4HbV
z%vvu*R+tfU;oG``DQlaMerbb{USHl*Oz98x_m}^<7~}o>zdh5tO94Gs82Pr|!^)*L
zAcd?+O0W3czlV{umc41e#1)u?dl`;&s);mFeo+xHZ1`f#{8E&qGL5W(FVoO6WyV>k
zhSq8;Lhrl(9ub{S;w?7PX*{N;QlNVkh?2hrCQe&o>!J{2@4LRfzT-pvAUMcA;Mg2+
zV$!hCBLg=8R|yeokE#L57lN*2ZK2$<Yl2pry(ka&<mBWp8yN^P9B^D~9t2DBOUG!s
z1sct~HteTx5x-tGcU|m`EzN1EsZ|0S%N-bg)!s@%pi_Z%tII+wrBbXtCT1JKLC!(I
zJ>}bC;!HBJGi~9>NE<I;I|ZNgyf=E3(8f11aq3Z&d^F3CD<nTiqR!3BJ3gdzB8&@H
zc-iFJKy+XQT*(*P&X;==+;rzfA`v?~*o|++8o>v72Z{OllSRs9i*rXOC&1>8B!0OH
zC;IXS2M32um;vWHyL!vl?%$}CnJJn_*_YketYB5icx>FoSXuSHEnBOQ^ZPfK3Cq=u
z#7nzsQ6aGk!U4PFxELDWIH#OH1)IriQehvZ1k;gu1S=~mkBk{FKw_-GFsCHHeqE%~
zF$jp{a(k@ja=N50RXn|#`H;ATpdm!@U0o}}*s%5@QMh{ZGh=4jlKi?`vYG$et&M)C
zJ?>5VX=zOw^di+g&Dq`2lq$e#o_`m3IJ}Q^OF)Vp;J&Qoo;Ul#wt?tqR`o=q-lBuY
z-24!`bZDd!?2A@Qz~EyrBR*GYr$v}sW*^}62hL$*FIQ=9)2o$&2skBUS@!0_jIhDe
zb8|_a#AcoOWfApxzY{#w2F6dENsA=$|C9|yW0d;Z;^7^~1YySNoS=0{L`G=q+GT`t
z{cWu=b%gdh8Nc5Rx6|wzU7i>X?z$w!pLV93o}FEs`$$b4FhoGrO$XS#+u?xSi#&tO
zj?;Ck1ciDxtfpcJyEfz&_>Ps5VFdqT!S-3EsnZ>}Vw=B}3C2pb3DAW-EJC?rBiH1N
z%y2uvcNSB#IGimBKOY_&Q+GxbqXXs^*Tlr+C2$bX8m_?iK`-c1`1a9+Zit1w2W`{Y
z(9B3{mDnU3a=F-JN>JJ-!~{$xjDGQ%leG%w*<cI}#Gs=O*x+w_!f)Z5)31cwZ}iOG
zU{w8L6$>3=k>ZU0Ao6x7J5yH@eiNq;r9mlEn@*WFw225eX@7fgc$gVRn;xmHp<zLT
ztSB$f(7&d(HjzeaFCwe_{QO)~<P2lu<&4|!4bk=J^~ZWyV{GH~V)8{<H_G29%hPnu
zPp3#&3G)6G%nNBC#0}n0UDrY(CaW3=w*ew~m!9S2<U{18pJ?p|2Sy3;@!@~g+LCrD
zjfTgow^{a$sAI@OJ#dwW%p*E}$Yw;P$i?TRSm*N<QfY<;Ph2uU9en#Q3PpT`nQTfr
zgI%5<8}5z}#q0rdSksfHk9$fakw|waKfaz8Q(-PJGkW8?FdBH%7;{;lTy$jFhIJ_5
zK)S@{c4H0FUC$Jon7P{-A&}of)42TI0n=drCl!Q(GH|?9HxlNrT&7ha5e@qexOq^V
zzTg|2I*r4<eH~J(A-l1ICtThG?3y1)SLYyPTx<^RRkAzCY7WFl)3~&+S3fY>P*fBR
z2spGYc1MXGwnHm;1!Fsl0u5VQ1r5?W9CUTNqC-UX?rns9cfK573id626lhXK#s2f*
zFvKiyln*M}_;ThE4tF3^AWHW>8V`=ZK`Eyy$w1um06X!yCzb>Se#RjJMn`v*(Ji&U
z_?>{anp#oU!3~RUT~@|9u3>kgwh}gGasrb?fcaeUdno}7#eyYjy1}|3cG)J9l*boy
zTZ>{ho69A9g(QBfyf_lQh1fpXOjuA1YK)3hUFQZ`rHIdYE-JkOjq-8X_w^4ICpc~3
zgAS%Zjj`}>8^9615z16*OiN6Ni1m|@i%<G2!f12Wc`nr;r?N`Mnzu~3LZuCgs+r`5
z?1Os3Vc)ub$OM7~jh^m5eoh4(nXNwIdom!gbiPv*%4nJjaJ<9%M`|~gX^|O}t7X%2
zbO^sU&_!R3@tjGA=ycGH76W$>)>R1nWU+3hYjq7N(#w)lSO8&0`Gm+&Y3Bwjl>5?2
zD2U7#k?cZJODi=YIVn6Hm_<)P>1$25f>A|{$M5<6g_sAs@Pg%SZEINkg#K7|qShj!
z;~C&czRL1)9b|-J!>x*<_S+sO;auo}_x(N}Y+rBh77&R-`X*>7z99!ekUrhd>uT{&
z5Xaeyr(`Tsw-pBSDCG;vIC_1}QWovU0VYs|6!yOIYh0;@H8w#R!C=XO$9=jMVn85;
zS2+QznToU*ngGM)n<>-tvPP?}#c#`tg4YPHtB~Rx>wZOxW+Un{EjQR6K}>#d-&-Uk
zU%fpzYQGOc+9PjfS(vv!a%nL|%hR#O)(?)@QoKUdzx?-%sLKG5Bz-eA9nqM0Q?w>6
zC6z!dtF4`8V`rE6Mp;>z3YSicS?CQ-OB#=>+Se40_d-HKaw;l6oTSmhl9Q9e18>W-
zOYGxGr{-vUbTvhu)+Rvg60+u>e0_I4c0G5!cD;8Ml$0oe1W`^=@%^t~zj7U}FE8VR
zU+HUYL{Ui(lM;QxdIVD0!!m&Y_m}wO?BT}z4v5B@UGC(Fd0ePrU|@EF!SZmYkvvY9
z`G-T?csq)y6Z_~+J*1^*vH?^|BYkV;j*bbc76EkW;NGsma6&%&ohyjysz%gVh7!94
z_DYi9%$)ewwd!VD%JcED2<>ybgW4@-Wk0)MKf<c05!NZWDJ2^B*&=7fLC@NEKT}j=
zr23wgLr0EUsm8e2xO{Nm_tvAWqW<~3$fo=e2!sMg83ZI_+WWkS5x0c8L_j|02Qx)G
zTz!UPsj?J-d4Lt(7$v=G?Bm}8e|0_oNQ$;Sw7^u~Tg<L38MJh<VbEw@`{eGIoTZ*p
zU8;hB?~-7K?0%%Usr3P?8@M_KfMh+Vp+R*tdEqNXi#oK9w2@6ZmFolG>5!LFSecmg
zOZ^e0F%2A^?rRomZcbJ>?@rgf7kcU{Dj;jEu1s^18k(9hm{ebVmXRkC3sUVo9}Z=+
z=%X>W;m~kw(EC0H?FkDjGaZEe&jOVia+U3lr40f8as(9z5!{$|cGD#e#>U2$Q&anR
zcXtOF((5tq>FJpqA1CeV>e}H(62r#oa*)Y1m?!b8uNf;*PhFr>O*@Q}wARj1;9&_{
z72w>}zOt2LulcB*d^qig34K`pI6#mRSGQJtyw*B6)Zi><UFE0_QWh?GFehp<ThYIG
zYOYozdo=u0Rq{)02grfW_a?|+66U*38)qb8rsi+!pEraSW@ZfDe&~fiJD2VjXp7)u
z{oFfrd9FiD@)9R1R-yoLqN5LeH0rj^8(ANVj3GJR)t>_al&%lgC3mcy^Piu;UtL}0
zvVx6e!YU&pF@FC1$-w*lG((`@jgKM3ACZ_)g~WInqvb@^IM|aTuK-Hy=X~SSaN@w)
zU83<!Y}2Gpjp|(2sAYZPf19K3k`hU#L6Z6d<D8+ZtNj+OnGsf}zUB8aNDBmuni+^o
z{f2RNPIEAgELk>}KAQ^&Idkj7QuU<p2C-3G=mA(pm{7lG&6wBo2C3rc_&7!)j#dcU
z#Nbw{rlux=pL5_DjjY30577kGBroQxdY=ci9`z9Pyw2La+S=ogVMxy0uE)>Lw=pZ!
zH0HT%HW!UYVr)dE44cTMgxBG;-Q@%Mn~7t%T!Ln_=JDU#88qg0cC#}@XJqmId$U&o
zGmyxdN6gZqGM)_3c7VNWXBw}2qGs>9Aj6C`%37Pdxtr*^H=@?J>U@>Q*wfc={6b__
zuo~!*h}3?hvU<11YT_doAiD9zYG;Pzno{hcWvH!*4QC#E$(cv#SVTlbeDA}l0F;%u
z_e87NVf|s-lN9W9@MWbuoK`88BuUE>yH@2T>$~r4Zd`wMMyCxR>)lSytY2Hz{lvF*
zI^km})>3TdcfZ_dJ4E=0;u{bvZ9)>u3r_lb%@QiUI7)$_-P~`{7+_^|)L>fsSG0u7
zZ7|y`(g~Eck2`-hIQr&_%q{cijKcV|OMP~!^)^5K|D~wAl8r66r*)pnIlX7ise$lh
z&zJl1@~4@$9h*=T{UKlm>P9Ik?5O?D(4^+Iu7|Ye*BC#Vmq<0?b~zT9_;|30k0BV#
zt4vpzGDf~4>KsCUjTX_H1cbQ5uaIB|VND4UQjxh>b_JgV@k)aaMbyG9%J{G#gz=*r
zLVxH9_cGIxlbOl=yWn<yZ-UySB-cn^P_HvIp?L+gp*85@s%G#yD&D?Fdk+p@6}E}|
zhnz4?1Qh)@blS~=osOR1s!lEjNo7&xKXk-s4S@_?k}UH>mv6wMeYO@YPs#57ik~f{
z+n%`@o?zM*EcAbYr~DkOOd<rm^}wj&)gfh*_jsm3-F1q1e~hDf%Tf71Ih9S7_KfS4
zE+w*pyQbfE(Xe>iTO5rSH$PTC39KxuL>bCM<rXLF$vxodps-z}nh8rou&a<}EE~mj
z6%1k*NgWMrPa#}d4f@^J8!!Tn;kR_pzmDg_HZ5Ejx!cn{7))W`>aJ#9u!6dn`V>%t
z$dC|v=!v6$_||;<kYeZX-5DL~z1<}KZRHa)$K|p2EF$Km?o!|8wr8~JdSfDKXux^a
zD~vYJeS&o_^Kfrl7nkHV<4TwyU9S1e8OU*#X{4iKj$%=C+mhK(KS5k+E_V<_MLQW3
z6>2J#oMoG2{ynFrN%mRp=LYCu)2L+Y^4&oHqv75CMIIiX<?ZP@5#3vxu*@MORZ+w<
z&VDupb#)p5u2?=(_opUfLWjHsI_f4fA%^du?LXRZVMwRJdd;L2`jO&WosMl(ZZ73q
zg~hO|&?KS&u!g_o8M+BSZT+!nMMSH9O^3dI=#$MUdg&qgWmJbMWHU50R81rTfZsw8
z(gGp9a1omm>~OFC3U?Z~p+}K=5r@+#m-<vAfnyQXRmJ#%C^sZt+9YS_-m<TA^y)_n
z^cnPlCCY}gp(XG;6B=&XI+yG4){Fm6YC|Y-%;pUr-s1fl#>dCY2faV|z=RGC4({;>
z2#nRm{APt$)UKG-$R<$lE!?g$ItH<z4Chpfu1SQdi5E-{y;S@1N7y%ezwor{lE<Y)
zO>|Cl0hCpgz^gAHr(E<N${-0-j?qw+lvi3Bx=HMF^d{Tf`fFD^7U=7=G=PZkAjp$n
z3J1e3igF4eE^rSG4RKa70gy2Rl{r3?;gTW1X^P+wNJ`lDq(!~jr^$E0T(A+udQLz@
z^Ff7Mz&smF@^}h4P?PovXY-&6$UbmVhX%32XXlV$LDM|T<UU<xv3?co&`n_#5Z&PS
zqs$}KlT7uB*OCFb!sD>a5WJr(W{~j<-+IH(<^Jp<x&&3H*oWyE7a{FdHxHSanIRmf
z`j*xX>zYSORss=21q^<@KXbW{d5X9o1?_*{pbP+9+pN}xA@I#BPlkBL415wVgH~7h
zp;Z9K#so>EqZD2Tum=L*2k?|KwIA^d%qpj#@Qsx#JD~I4#3y{(bLR79;N6cb!pc(s
zzd`jj8xIP4+tiVfg!OX{5mJC)Oj=lr)YYuLp$)tauaEAee|UIUb&V#_%qJx!B}%Z}
zR|v#FPFUaC#`}=gAs7P9aJ{I~$!xlHQ-E_$nxYT*n+|r01~y!ir@{B{j7=a2@%Bg(
z>vsah;}~wXXCJ*ieytWK1J+OANJ~tC=HOI%5^fIdHn*B<v^GA5OVao6-`jNwAhKe@
zU~ZVw|3wQtS8Ot%|Mk);s8}i=9}5(9j09N~F>msJN3?-OoyN~_i54%O;jXD?@Kzvz
zm+xU_7gpaEd4mKPz{c5TpB=O_ZaYspt(e;fjrVkG0J90DORLr8=P^XfUvCd`iF6G(
zTmS+INaI`8nF*}`)1M(=LBl+-4-{d%AS;-VZg-uH7Nfp?{2pRrcfdqMAY-p1Kx_Sk
z1bKeX%e!VaW`D9=QHwzb?4eivdca}TZ93CA3P;<}CiN)f)_1}>;{m4H0>D0-)=5(^
z=RQz$uaTx?wm$DYJ~r3*J75Q8Ak<rJ2d(^QY-|MZEi_*1yK{pkP1Y}8)YJo&Gr+lE
z2Tv#5eE?Cf@kiS*yyU~*q7{n8-_QhtXL!8t3f}BM+zB9tk?;0AndRl>XO%XDfUj~}
zT2{<H4YNT-ohD{yzt{blomDcXIU~dB!m>W!5^JgeFpd62aRAf03}OCp*xe)pl1HT6
zEcElbG=A|ez^YHamQ0$=5^t!EvIoov2X37CUp_Pon31W;Jg$poyGKuFv_NxSKd}lU
zZ0zj;SP-)BLyX&Q3H>9$APG^~5Mqh+M<r2v`Mmq+sCZ?R-E8m0>=*3Vj$BvIOkfgo
zw|*U9jEcFtB>)3p@qLU)Z|MjSA^Q@RmKC4<UUsw6#(UtMH>v4Hgr{ggQxdkeH7l!m
zd3hxz|9PnwQE{_<9w261C#cqLZf?}o1LM-cxrp46(E|-gV&=jkBFERO%gZLF@3p-2
z;>p6Dq*y|m?Em~TEFiVIskwQ1QM?(phhB`->l4QPIc>ZPN$8I`h>t_s&7ZZUV{TT~
zx&J=!!dCqvVEv}A-?fM_*b|I<-0S)1`!&4qC0g)7bN9|!47ZZ4aTE@7Mh()9^bm<l
zNii+e-=Pe8L4pYUTHn@U@F)9U?BfAYRy(<ZDRC;<84gw#h1E+w-G>VONclbp;4CWZ
z+T5Phc-$U;oXmyw-T8!HrswDPn=MIJu5(lSi3vLTH@0_ddhY>=%fb>q0l|9!%G+Xd
z^7YBab?Q6;Ql^*9lMbfDqxd~5M5}bTzh6<x2P`(4P~qZDmEl-%NjHrQC<@fvR9sw)
zmJ$3NNVmjz<9&OVWI#8scjtAPH&q~zeGymJmX%&ADk@;Ef#+{t*Hv^`2$zM2U&1CB
zDsYkz5CG^_86U$kmEP66eQW@GrsqBY&fWLsSCPh~7CSEq<^>3y-rscIU*F=>Xh#DD
z3(!oUN;4F&^)@Oe=l%ZCQ8W<i&ealyt>f3@l!{%W2Ceg8jBqvs<e)7Dr2CMx2!vsA
zC{GC><zG%bog=mc7?wrI9Q^^4&rntT_U9|~OHJ>7cR=N=Y6VJ}Yb2c4T=9}M!UG#_
z&K>rXhD#rrQT~SguLWjv-7WQ(@>Ut(6Q=clb~unw%+P)Mv^?R)#K@Raxl?F^${U-o
zP2%_aX)$J9Ljz{6lO^S*qlNtaHC2<pUj118e>(pnnx&$wj5}$j>j)=g)uP{je!mQ7
zR_ABDu~_ea(Ml~*FZ8Pa1lWqN^6W*+!qNUPa&j6AyB(N*+5J&kZTG7_NQDt})5(3s
zm@Y|8AO->sQ@ZoNVbKDYJ>(5+(a#@JK~&%o3+d%0RpRJ~BcdSPAemK2i-16LAX6DV
z7gNY?1JaBe{^0LR3|Xa00J#+VZfPkiEG)cre|2cJ-U-KUx#6>qQixRlzY!1DD7jBI
z{P4w84}3&wz_Sfzo&tE#i*esTFk#>%1563Faa?V4UmN~txz!&LPGa2bcVS7S5vEz-
zbA&p|@N_PrtN}NG>{q#OAha+5jE)k~!3toHki{CJMZ0V*U7bRFD8d2*1H<i<WoLeW
z6wqRfmZf7l;M)LZP6P)BCmZk&TYdTJ|0l*~goN=q*j=CVdXtSX>|(hTq3g*)8*r*B
zT3WH*2&jw4#l@LU{-+KzGD?bO)30qIXZ#Gy?}7Z_3pdLZ%yh}#G~Q36LngS<V}F98
ze>{_Q6Y5Er6`H{HD8ND=*D9(gL`DWo0O)=YW6^mQEd>v?U(+jn2O}dNv(r6zO0D{5
zl^dga+R{JGRD+)9XaaU&Ojb6x>zT%!mz5dAPDEf`d=jiKHva0oXK(Kq?ZT)RpoVu`
zkl@7ofqlrs3SD5s(7@n*^=Dg9LoGKic(8O1&X&A_pCKe7jD%O*(b2IV73F87ldv4q
zpM1k_P9lkvKu$>E)BTRDR*`^1Q)z#3_3>N2cOmM5upST-!vNRd4j11QjJIZ^)yO+9
zv6%H|YJV+SAZLE>BWUR6#*_V|gN;;IyF&#fy5z_RrQpEoqUKWpAWZ=`jn65o2g3Z0
zm**MHSb_qXS<b#HA3951?<Qn$73rM(U(9;dNSH#bJ2xJE7)JMB3TMGUT-0H9c2;0<
zcrQ!2)O0A!uW`>7swwu3+7I0#6kU%veF=4p#_xQ8Tj&l6a<Ye>?UpDHF50(7#Z$!x
z_9-}7HcRUYF=gix4bMP4fKy0l>Gcmy@8=(DXW)bE1OLXzei@Kvdo%YHxtF792z?@Z
z9~wJqM7T_NhEPoyx#~jcF*Om$R{rXnQX=pq5ouO1PX_Tsq8Tq^SrV~9&^^683S{Z>
z=4R=*3-wOK-q>kXZaTpSaO-^16@HE`1*tq0>d=NO$AElX$hY9a!jDa+)hn&Li+*zY
z5^}CCMH=c#5Z0O}aum45Rv5X-thA;n8CKg*2a=sohH1WY<0pT=z+*FB`Zh4eo4qSt
zD|3NbHoK$v71|SS$IV4In<O_z@?UX76ug{F*-{4I3?#l<`f8Y@Ms~p6SZ`K!2SE;U
zLxobr03iqd{Q;(^<IeTwdD4Etk_@ka*C-H^9DPA|ZMM*KqQhP46RDM1Urc$g1k$~)
zha7xe&H$_Fr0_k7)M_^fN15jPYtfbZi+Y8o+UC}86&p9ne%V7y>)(-L5G0y88y3bS
z4$AQ5Q38_YWj6&k7S|f&P@>563jp|S;uh5CdH$KVrQVldm(NH0?$f|lW{tb0X78Uc
zG1~+TYV)9sR(zg+J>oy!o{@j^z5n*PEBYhURbfR&dO9vVoso;nq|QIlPigLp{$h&6
zwPkM1uLcss`OE3@<bjs0kA9n*EpoESG$M@E#zdnrof0jRH`9(T8$D>Y3Vm58-9$kd
zo;+n}$oq{?>5pdjZ#t6gMZJboIPH&WW#*Rm7quj<gVr-lJ~VStdRr5m^l_RxN~sOn
zmpbF?`3G&EXS-?rf0{}y#-$l*dTHu~PQtv2B%PX?(y#ONi#40O)>{;4!y;MaF!LuG
zj3#f$k+W)0b~0S<sVMt0_oR_WWFCS3(A*siImizcSqbFCf_jsSgwFHER_tTXkxa+_
z5(~7|P~lAed}r|4%KD&b=&pciS|SGh>ODn%_YodGj`1rgVYim*L(SCDv))I_eJ8yZ
zOq`vZ3c<9@h|jov(+!s(d7<AuGGSyRBQ!Qo45sQJz5FAYS_M$OCb_NOeZe_HVKi(^
zd>=^aftH*oj)FDWKVLl-qA^xCnq)*Xb!{-nzT2czEEf7>cSl>h>e_OcUJ+IcBqA()
zL?V7kJ;~OMW|t}7t63I>Kb0jeYcAj=Iy{lx_}RSwH(#E{r#1F7t-58u_ZJR%KZKZU
zwHUj@C$cNh9T=vS^M06-SO69!K|xooZp^W>j0590B#jiuklnml8D7ONrQi9z#JMg&
zU5OK`RDa056pa7S(`-yj==D4Ly)@BmvF`N*4Q$oYg=Mf=N?W7Uzkf~*I(GFlW%c-s
zd;_&NqcdA$*I8385-Hgp>^U2MqIYe9PA7$vVi?2YS2rb}>*C2?yj>Zd$VH8oj$i64
zJ5)7h+}3CtYAB6$VE6`~IFHy2KA>3;d6()bgx1w_MU<**x#YBW*M!xzfY+z<xbK!Q
zIhv%I5EZ<z_}n=vgI+6%n#tdSg!Hjui?U{EGedIVvvEZ1#QTKmi!isifr1YOJa`<o
zozF71wF|{^4fC93DSst$cVe^avV_DzXG=IWz$vwk>ir5VnRe+<qxGsoRHG$5LME<g
znx45``_wjd1`XAyd(5RJR6^<~V<)-ao{KW*c4vgT`Dq;RSCqiEs5J7e;ufxX#KF^8
z<!L+Ai)Qyrd@liNFcLZf7Vc`8X(G-zNEU=L)Za$&d2}DU2?q-8U%c95=Dr90`bsd)
zt3h+D<~@yaCEu5^>H{02GRs709LmCf^P1hNQpl-9RBkC&d22CY9+p8>um1|9Pj#x7
z|F?YEO)>+g37iNV>cXod3}>{i1%u61Cx^O&x0<Qp*8X*MyBev;4Y^ZC7bxU_nT?ZA
zmluxvMrM&4ohIy=HB8`G^Fg|wk-cZfsPe2yiG)!H=W+uBiw%#Mqh%!VaUULFzEtSt
zhv8b~JoJw<Ee9L!fznk~B1#v>NsRk%SGBsw%de50^gqVl<LNuMtqL6wvt@;(LLf_6
z*rs%DD=ci=i{Bqj@}mk#4#dg27`j?Q@J<3KSxg++F5|muCUdTjWkD(W-VG=hR#hes
zYwK?eqb-NS!%Z8T>ZYP&6cw6k@puXT>nDJT#Ke&*1l@tI^edCHrH`!xRKIHe2$#B~
z4QFp~uyOwDxd{hJVCaM!rPgQu09h(7DOosv{pEfy#<=M$D}&Z)MMfDTp*>iaY!~k<
zZ$iZVROoB#mZVGF;H`s)(AmX1P~P|4?0dnzc&{Y~zO`-o0e5oPQR+=DsDQvk)TQ#Q
zhOH^98}qc#OmN_xKKZF$eIAHe_A@6lRR$9xWl+PrP|jUCRh-Wj@Vy{rAD>LaEKiiL
zwDq+_ym$xcbAhUcdcZsJ&CA&fa(j$(^d>lu(1pk(f)%D^_FXg_b_-!V>nMy$%oR?q
z7vFF9AK%~7Igiu~rgWJJ%9mg(kubOR-72C#h9*Q>H;OHi^bvm{N<?2Pr}ktTtT%##
zaH^^<5KH)L{sCK=^19JSYnCAc!2{4OqMr8HIKd7fYX}Y-%#^obJ+Md_dl5P1>;A!|
z$NfWojEA;5us>a7Kq!}H7-MBNf8xK9Nc;wc(5zr$BvcvJDce(j`WVqCv8J&UiHl+&
zl%RMgi;Drk9^L@Ju*Cb1{Bk$ZVlY&zRe58mlOM-{aP=NQctD?ljInwtFl~qU!1}E$
z!uO;=lAw$ZAOaF#oB&BSTRe5-tSV)<S`>w-E0NBiu7n~3ELn=T(+h=`A}J~P<Cw-}
zRgNwp)g8-^Bm5Tdi5g9IBhL&%VIQyJ_GPp4sUQ?wFX{IZ@~54dQ+b{HkJt3kDM#-B
zZ%C~8mcX_8=zjAeDTCOl1uP^kYQw?F30;&LSa_Qd@BC-6S5B82c`!Q;-GCB^>GNgf
z<@NuT57NyvJR?5+hffnh4EzOT%}vMcR-rrMH>dh@cC~4KjOm}87QpO{0859DjGU1`
z0EBUWyVimMHIDx@!WFqscP~J*LKnj-6a8kR1rs+?>+7nxfOuXha6l^^%rV~g?&58b
zp33Y%lAl%9V<9ae4Fv^{xOi>eM>dpHRpYq;<0T2db*-=Fr$F}fk}<@@9swwUH=tSc
z|8!`xKgcpik~fF4tz^sRDnl1JIxPNEv*EF*^s8Ee&9|{;=bKS8-Utv$a{qlKNE&^v
zyXGoP&A_&I%@N31KYkX2#e(8qI{KH#es#|=6mYycx7N}H7+p#XL&1VdKxrYayKbij
zHNeA5*bzquk0q%-uP@T-Gb9Ha|5mHdz2K?80fO*ixky0)29S4aB3!X?KM9R)R<ct=
z0|y-BOkPb5e=;;Wh1Y#`d2MZtt}m3xntKOG&c0{w#^l=l{L^G!O6IvY_W93Q-p^Zi
zlP(@YZ+**mqqa?yC%(>+TR=3*_b)(Zym#_1U~z2`01rw>_MQJoSr3en*sref%!UI{
zDaf%X>o<GZm8drNzp)b&vh1$+)rS><^cn;=?Jc4}ZYTU3fTSQa>s`$U5Dsnuo4oW#
z3de35zk^$tEMu}HW5&t3PY9)%#+XVU-0N0i(c|C-prcX$!@a5P#z^d}*y=YOP?|<r
zUKFPk(|r|}QZIQ_Ejv-Ab=NYFwa%J4KYF4&r1rH<JB&H^w>@gZFQTY=NFDxd_ft}P
z&5l@`)mr`81W@ZG@8W*gqg3i*vG}YJbp&J%)WxNx;#yi-{b4izVe96HheH%$B0t&D
z__?nz3(8<-%M?W^iKvOGgC3}Io_j~FYXuo2!EP~z&|gcLJKtB-6gJ8ff7&*T)gFJ+
z=RhBslGn^xzrEa#0@Nz=$q)Y7xAnwiynxu&L>uP+mHNIU-}<k-_Ab%TOA-!#;?}nj
zvlK1?ss%--f1Q`}mez?qEGN1wEHBpGIjN1ZsOwp~irSP+j6EpJXH83%Ebf|OYJu9g
ze$<SXMK))ssy=@|zP*CBej1TzTF-c%De68g3b9vC==*Eg0u_#J9n9TkHZv<86qP=n
ztx0^?-k#m5CX>T0U~DO3CJx60N34_sncIKBie5w@4bcxkbnNZ6W6cn+g+M%*wm1Ng
z?b%&8oHA`CXkFX&q7pjP{@@(>Gf=4|m-(QXcZq7d<S>vl1pMqo8S`sii#8#vXto#e
z)Ai6={X5u&1#6>o#rq}87V!efu0JI|G_wcom?m24>gIUTI_Ot{<ceyPS{^KydaO(<
zzbqnMkqg?M%=002h8Lr4!tN?DlVSyUD=CTkVaxW<nP~`}0qYudj|H_&LF&|F@O90d
znF#C3Uu3r@hT>_z85sCh(-<TqWK0oSSzDJd>A`4axbcLnX4IvFPu>KC@-S%QDfx@e
zo=ex4w%+?NMnfGv>9kDfX1YIM2kJLFOQdhG<T><^8KFAYjy_$CHrE)K>(#rpO>o_4
zv;GmY*<ZxjRQY7(_~>61T%G@;X*VY)M`$#K)9^3nYN^}`je_u>adjDxJrZN%Ucr)0
zmq4S6s@seBYF>{eIqYx``QpIu;V{AAMbr7GsIaiIHnOEMO)o!m0!Hnc%+G8Nc`UJ7
zYmL^OS%Q^;5DcbYdN=#no&8W+O54N@aN`MmI!$V?*k()RSd{WhbB^{VvM%3o!}eH&
zk>1s`F8WScUA&bFD{XLXPewrWOj5fwL0J3UcFS6;&l}ox#x{2BM88a@F?kFS>xq5o
z9i_$e*kX*b0#Ws5lcwuW#ul7D-|6(gX@>Q*C7;!A!fL+mcPB6zN_r-yt(^}N;MY3q
zU0(Y=vAs*x`&94fJGe*Wgb<|b)z0C0I(><Kf%y|i*-1>f1zOfunjNPW#UuGQdMuWh
zruvS6!JUQTjV>=Fw&e#~qVeH==$88Pb0Sa0<?g&^u@Nq`3oG~saDtiz3@+cb0AxeQ
z@4hewu3;h$tE~WIn1C4zo>K3_^~Q?Rosp#Qi@Dj!BAOuy3N_#$m{s`{DGIl$5ujXC
z_?-zy@hEO2tXd<bkg92noqL(d&V(Ku9+s43{J#Bh@rL|ARs+OPq$ibs2sYx61|X_t
z*Pgh`3HUGK(H4ijU#8KZr`-go#TUgfM$CFn$70R))7Db;sgu&S7X<reqv3HU7NfxU
zpVn45){+g`IOxpDN0~I%-ene)MGXcDIW|=s%bB^UMHw>P3`>5A`MDfZ=<M4hrGq~5
zZ;ucFP^-_XXsi2QGeATL=&s-X{2@6MO9)&)5l3aIsz}G-OF(Rix$j(?E9t|+-M({?
zX`D-tmvdO3d4jD+Xj$i@PB=fZN0dtp;8EjDt5o`$jM$<uFDPSeq+q2w!()@V_&xMI
z(rg>CBtgwOC8W)sVOj6#j+=cqF-c)aT>nC1brdAF|En;3^KZQx4SUMdBu|}@VXhdf
zO__y-#rPsVNrltP691=*sve3iYwJ+OBT9XEu}>9&_+sxHmE)tLstz?W&K&+dhx1~J
zb&8(i@wf5$dGO@?xU0AvLeKaTm-F=}iUd1j<DwcWp5NF9$F#&*_VFA5ro1s-Aa4i5
zM|S!x!*Hbi5)?|33&algj!*Zt{RhnPLk}-fPUp?85gI{f5s&11R>s9WJhSKtPDvsF
zs`K=8oO$&^XP8QH{TT1h%0Ka~5Rb&C_FILu23^@Aj-_%FTqsadnd$o$iU1Pt=~@5`
zPh7gxVFmZSlLz=kA)U@rqgQm=l=cjS4&F}QG=LEMI{XP>Nw~kTvgTxFcA620PPfE)
zeA&kC#I$)Qv6oPoJjG&Be2%qGlnW1xH@~>JnxGeuXqJ==z!ZHidgur*{hY8;<>Nr)
z;3I03QHN}@^!fB{#V`TRzAe=J0-R<8lNpeK;^hB;3iMAJQELRQs;Z!nUF8&oY-?oh
zoUAm>Y6*CCZEa;^;rQ+R?Wtea@`%Gja((1cGnc70j_3w>Hgu=#-Io}k<iR^N1K!V_
ziY7A#jn0!+W;ZcAUZ8@+(*U@auDNeMHdCAdJ5A8pxoL&I+-BG<E4D}$K1{YGSX7k5
zi&m5y5AJ9(M`Ct$D@!Dd(XjjmKuQBLG9XR5fOuF{{RUUCx}atuI^)64iQ`w)*U0wQ
zWvDdudu`S#Kn;a$_p`<0t>wdNQ_8S(<jZXG1t@g=)6kyqf}6&tq(5}&w7vaH*&UWn
zgF%wG2S4M!bo$Od$;Fv&Z>VXX<{O$hA21dbQUw-}V0sS5u#jNmmpZX_>ZR^(9{_h=
zMTkfoJ(3ut*NT5z2D(u&@bDLH{<mtwd@S#>zhAro)GSe)_9s3zyVPBRTh2Ep19N4I
z0?s}Th?n1VK;w5yzWlIpaq@M1<Vu6e27$J|E|qOBCoi>)o}9dE@c@OscXDB2zmbiB
z@ta1AlVWaeu3buwcetSEk(8)-nW4?(=NYnmzCS@9<pJqsO^gFlknY=w9?A)0d`d4s
z>zz0dq==USk6H=H8A0`TS2R*{7m!qa0|TM^`+I>(Hue!3vix>Nqe2r+P0jz(D1zDz
zZ#p*>$8&;hS1zj+ztT`s)B9StVIYR<cwT$1rKcV({sdnLPv^%8%4CG;hKBj8TSjJM
zymZ`V@<c`!Fb;hd3V{?>a-uB!jo5k1j-%b|pqnBldPE9?>@`g4vEKVyxBs;hp!qD{
zA8GbVb^XpeNf!wO@44asc)?o+b~>*&92^`1u~}A3KDC>^ex+nV<d&OV{;1!-N{1+R
zJy;WzDft!fvAxsV$Gwcv2f%3a|1dWKr!z(P0c!{|yE{9>bT%%pIjPP$KQl2+9a#ze
zhUrFUmlrEn(a>PdyU<Z3Hw=}@Tfgy%Q95OaIl|V8eBC>Bb#D=x!3vmyW^<em?{zgj
z3Ag1gD1*{0JS^{XyH5wh3guw4Y0)!*o8k=TKrS*mvh!4obb2YA3Bv8|KUHtX5C(Kc
zrS9%4Xqv8P8$wLbVZfJNS7%4!jw^?B__%LK0oMvFam4c*(K$L{7rZW*ZWVGZtBA(-
zWl$>2WH%(Ke||pR@iXj|g^@oip9L~wV|vlw#Tw)9e_rMOu7CQx0%}8ebhYGZ<e4(P
zBWpoG9P@X;1Wx*dypSV%Ci4U-8bV-4L^<JRAY!BJ7=+kc1j!s`Q}XoVx@Y<W$^|Jy
zZr~YSDGDx$Xt75a3Kwt4rfveAOaF4cWtSvT0IgXFCJCqA@Rd2nz_^45yJvh+&||Y!
z$fG3lePW=f27fbB4}H&G#>Qw&g*W_;TBbS*9muDDb79XD!I{Cu<~Lkua*+f3Ix>-d
zGPusiK~IjknZO|h%?Q?p59@KSBx{(O^T4Aq{cAqKK|o{XXg+7^>r}W@q*&a}W?63c
z9WBrt{~T{`Cj%AQ4XV-afai_}K&1-MlK8-Vnq@d8;_+$$sW)}p^$Q1wkzI`5lTZj<
zW6m!Lzm5l=-M0)qHsAo}M(2qdWlhb`fC}k*0vgCGj<=Z@5d{OIy1F`^7<&-qwbyQt
z*xapp*XiGRKUX&Rz74|v<Svw@znp(-)l;4P0#Z0?%t1d!4qWrExsY-=cNhn!Q!u3R
zl)`(u3mv5xvoIC+`O7~_6y$}hpx>d)5r_&q-@fUgqIYHG071h<gy)JnIx=~<o77_p
z(cazNO+rsb)25K;WBuS(6pxB*9);ds;hFL3N@Lv<^Mws%aLUGOgcaN1Pe*CYLu)}E
zgQK$zQSONHWX-k5?HuB##0>H8!GJqdgf7S;OvBkuHu=jMP7{s28hbMaI|e_|blNGl
z;o)EQOnG#7_63+N@89p9a)xLr%{|*t1s>34yt2o^?%oz$uJ_ZIk@Pt53>^-1N>U#7
zK^5!)ATsTV8cv`N>Frp1y9XXaU;#NAIry1msT{TMw@R|NwIzxMGLR@*qAnxfbhpUD
zN5dHiEXW8)$GnEF@~4S=wc!FxFBH|I%x*^Kl#IgXmZbPObCD%P-m@8{XB<W+S%L)|
zGJytE5^%ZAl%k&s{rfmQSb_y#lJ9#XCGbUVQNG<TT8j-+fSG@_k!NVYFM|T<ZrhXp
zNDtTZ=fk$wtDbT4bY}$?Vw)rkfk))r%>3&R$Mo(884&lIH--wE9fC%H1akuSMA(P^
zg;NjnD0i4~px?g(iVbIp0S3R_MQSE?LFnLx`xhAN8u)<YbBp<jJ7<w0G7<BIyGQGn
zD8NUT(?u6}go~w_;x&rk^1Ou!%J6Tu`cjDA;gz_ZhSv7xO#T=beIxnDpO<!^(rZ2^
zIDoRC9qR)HoAPm8Rn^oY^bxRCU&pG{NKz#d;N(%mp-MHHupJEh4Q($<1!hvg^a5eu
zncf$vLfThPgR+2^&%+ZF@tb6Ik-!20bsa`zg(G?~f3L1=jZx2#fw}d1@1)Sh;c`pg
zq>gyTMkSqEy=0=VpH&lciv%bHEZ=q8+t{c$BSN&GBsAS<2<MR)e*y6WwaUCA3%!H?
zuqZU(=Jx)oXlrY0-V_^3*qsK<+aT}XM@&Y?INe1b2UMHD!Y@G;0#3fqfbv%NWVOYZ
zm09w4j=gAry~FiU!U~UWOH0cv@di+bM%<gQ7`O_7to{acmsWt6Z89bEfNx>%2HY3-
z=;>+s%I`fQj13f^rt!!wFg*d#M5sFlXamv^LKjb<h;!P^;YB6^NC@O!`=D-m7fP+Z
z1mw_1P|r952n3o(LH)wZYkmyzIilK2_&`lvzC_k2e%2ulRHBR{=p4yNU-|U*!|!SG
zxZZzrE9U~_f=4^8*1MrV#bNy4p0*022TQ^;R4``uq){PJXDY9|+3|Zffce3Ujg1ws
ziq#wTa)9~NG6TR5FGZn8^A+K72FySPf(nrI-A&BQ%s!9D@gVY+bnrc*>zOtpIc#LM
zUrh~*bzn(mW@b3<mKMs~3zfM+lnliN#5uFXk+gu22ewi8irI9JLkRcd0`GW><K6jo
zIBwQdD8T(#4yb-;vk@}FSIa4FkjGbR9QnJkHXr)LHhS!0P><T@FORx|dC<ZLC|n40
zMWKL*2S$QppH7kzZk0qyNvSi4RIntokblu^Ey`JXwf|_aEFPtAlPj6zE1{+Ka@r9u
zP?pJ($6U|`xAWxo{J5|vF$wGo)Q-!yPX>W-o?_>Gbve(?F#vEXG50&VsQ-A@f?H$m
z*o_)tffuL&gZ6qvkjIm}-$(8l_fHQN)@Fp)WP2%N(~6`<8@IYXQhi{jDJpLGm=&hg
z5Tu$3n(K2-z7ci=|A=w{^fDh*RaLL8MF^bFw*qV8vdIC-(>cKMhY#HD4eE{yZN$gN
zBjQncrO*~dcMQNOpNYq=yVaLzy^BWPCLeg68JCcNciv3G<MQM9Jy5tY-q-AO^)Y)w
z?-?>xb4)ahpfIMea1{zsu2`h&dP*@6U>DP~bc4-sogfFn16^GJc_y$X4c5Ey^bV+`
zc#Y3o$id>@07ABi@3=05kUC6@htgb{(ACuyGKSOgd5`vehlgG~yp64`FY^XaU(0yu
zjLQaNfY$#a2PmS?8I&P5^gw|zzU~FU$ZR0H-Ad5w(4t&>2M95kU(=Wz{=)ObIb!@p
z<Z6os&gG~Nj8Fz`PYng1N8R$%N2VHM`R!wBWV1TRfTmz2TSb&WEwZ?{xYl14K*OV>
zeq5}QLH3xWWq5-HaRgVS72amDu2)DZLPEYk-HVDyI4M7aB)Qw)=g)xj2=a@QjxJ2Q
z0lhs~T06UD%fz?nh1k|ow43&(JKy__$A39(?ahyc7mj5@?e{YvwF@gYB}J+X0+fEq
zj!tO2AekRIv{<5X|G|Nx4)i3-X_2tdx;;QIWDAS*5g1Sp9v(s$S#}8X3cSRJ{jogf
z+lr#!4l6QdEyVe_NZUZ%WwkB-qmB_o<7Z)#@+wFdfAfnap_t#99x0ixukW=r{~J@*
zjI-bj0IST$UDyCn-yJJMJUqPX3(xg65C<7RHZ$)6Qkd_o;m>64j|Bw<9}WX_yslto
zF8Elp=5l4ajj7vKHG}Tq@Gd<70ZpPj#Wa&Fym|QMUN;bLyh<lPq<gh1k<rk=9)5w2
z{v(@8$Ltv25*yrxcaU-5bDxpQ4;x5rQ>KlVSu|y9aKAmlai{zOc_vl7Zt~RwllJ!Z
z4i7)vBfqgO_WIJx48#s|yk+VAiYkvr`C)|w2Y6Vgvi@r~1@d`E_cY%2Kt*okEC~Wu
zR|}K@1Qy*XDRamuuCAWe=w?QIQ8ty@7g~o>E?yGm<{LJ8`&=C#AAj$zF05mejN=;z
z_o5&L!uQa7=y1UqlQy>S4Gs-WaiGjhPDX0Zg@j11g<*4`T=BOk5Xr9Dz>=8tH*SH@
z<n7iweJR3_N5wyIRUAS);c6xU48Y?KxUlcGkA^!vaY5%vPVd!uD-S7*!~;?T2oB*I
zk%HEwv=JCmFdVaJE`h{sXFjbk%}hmi15oonT)svt1FQAT)eO|1m0j)LWM2x$JnEX!
z#PODX5#OKBbXnj~A;08OO^dre5x%Q(J8X8Ju|>p*lUvC~5bpZ4S=&Il`65fLndBHN
z@BKJ%v=?{Xpt$g8K$KU0a-p2nDBbYr*rIBbJNs>l<6nvK1@dCTpcLL4bhMbbg9ep2
zT2012pX-l7@oJd|J9Cb{6Ow860r&R_blR=`x3~5Ca2$P2F}lkH6IHkMOS}NIU>iB7
zRr6W&-9wf0EF@q_Z~i%5>e-60Opq}XTq-5@GwOnC<se&8z5VZyjsK8qt*Ig26ig7L
zA|Wje6&-oyl&sP1sS)^}0KFVe?i~tf(J=elXy8f$*+&5O)Jy{s(t+V~RAq+1zTE#Q
z1FUVL)Wus^h}4#&n;~LiY~6D!tt_ZzJYIfN;I`+cQS9dgl&B@<*QKdwYO=^@#l*z;
z9>e$8xsc}2R!y4qpeem)cbz&vp9(9{OiDBOUak7fe4{81V9+aqyklrhC(evjxqsHk
ziowrnvG?B(A9vpEr~Nf?wo4)~J~uHE6<5cv>#=YYWgKx<6kFYEZeA(Z=+)-kI$jRn
z(p+g&n&?U~I0Z=PN^d|7keI4hkBd%rU2cMggS#r7yrLg~CWvcP%;i?>DCs=H-`Gqx
zH+n>9ZCe9W9B$bC0&4q?Od~r#J>9khLnOykgPfeP1s(K4@ZBY{Bd0F9IZ)a}LVj+}
zPgA9@m4LrUj5XE_baZJIAy>JI9|kGx&WMd%oZ7yl@;lW3r9Rhe<Pa`PvH(cB+gm{V
zZiKx<ZkEnN#?6k>oeEubKsl2NT7f?Ul_9Oj%IUdRAL8p@BJp<K=kIKx0<XVe1RAtv
zw`#2e@V+v7;K=OuchwL9#3hKIzTAdg^3OnYC{V&TC2>f!!3vb5IJkl1Mh6Ec4_c?_
zQ#Dmpf7(T44NY?%DS=8Vcv*KEKmV~XCbS3!k1|={c8yJ1WA6Ix^Vpu-iU(Pg<+>q}
zD3=aq#W8RL|HUBxH{2I?_Mdj@4K3x-kg5@&l5~XGVgO&?ril)e8Bj4Ini)`8u(|Yb
z(i9{r`9+2XZ?OgSTa4J|lWl@p?KJ`MTK|tSh2(NrCOEx-`vT+4)q*!|-hi*NzK3z+
z9j*Rh=BFP{vGM%$P%uW&$Vh=O9OvG=gH;9=JRZrP5n7<;w(IR~30QAdNPJBnBgbxN
z8szi2w?bv>{1!b35*Q2wcT<>Mb57Z~1dY{S0hw%T0N}+<ThTBhFlR<Mr%@7=;o;#m
zgk;mS+1MI>e<Z7zSBcVRnD=`>x2dxU{VeBT^|uG@N`6lA+65W{pbZbRj|7_w<W=ag
zqCwN!1q97dhrrtuQmEu7t>@N?G`$}rSqRlfLZFpWT+jV47x)!;z<&=(BH?w5-;@Ou
zTGlC5d*4rq#{j^%v?+jACFHN9v~<#DSVbs|FLKEoie^&){qpiMvFn8PsIzL}zz08s
zci8<2Nlc9Ak4=YX6Gz_@>`Gt*AqRP-flhrenT#)W7|&AlX{i5CHD?+QW%&2~LfIMn
z(u6@IWsD`%6l2g3LWE?pgrw}t*tappl6{So$(n2xF_bWt5Gf&B_9fdO$&&7K`al2Y
z_5JpKJI5T?oO500`MZA0_xlkQ%laIaZZtWCTA?OK)(7>PP1_^V7-u4Xm$c|@9a6X-
zY5As(w2Yql^DAi_OOZG1bFXb})LHS-g9ERdtr!c${vxEqf<ZQS>R906f&Z6%Eiq1P
zBcu<s47`H4jq$DvQHt@`P`ulp4lWtgin^shSNCAPr>`gQX6S0SX0f%OPWS+!Z8M%3
zSHRYoha%6~;}@be(iEL~vqFmx4uZC3U}FPO<H8lJiJWCRlYZgVEk7-TRGIBckgt*u
z4R49Ix%LFnHQfY%xOIFaeOr<wdqH!H-E)u>&tFB{SVsuWH}0%-^_`^SZfFzvk0X?%
zUydONl0pL1QXH}t6Bg}=XX$)^DeSIJbing6MHxv8w$Spfnq{k&?VY5MHt-vb{RPXP
zL+s1gmM&z<bAzK_X_F^T*6zO)>-w2MIR52o^KU!SC7$uzZi`g|Hg+p)Y6ZbW&GYon
z%M}^l#UszuwYN1&5d>RXztfL@0~K(Q3P*nHcQ)%H3x2lHjz5oQ*OWn|tuax$&~T~a
zlg-xli-9+mJR5$*!3m1dyUVFwgJT*!icrfvVgI~*eyuI@z^3>a9G~R7U9-W=`NGiG
z1{`BhgN6!IV6NoFfe!tPEch+`Aq}JB*!M(7Z7J?}>->g+)l+MZOq<RAOq&=Bl~UI@
zm(Qd9;(QJlr6-nee4g>FaQLt$)utGh1iQe~$L;)!8U(VVk4_IaQ1L?w`94T+)Fmw5
z!t^f6)m}j`bU#aRE_U;J_322?n~H2#Xa->>md5I^6H27u(iMZPNOX6_N2bZ~Y_C<N
zK3_>t-M)E*Jtk^A*0$_*ui!*hM&>{dS8R_$#j9Z+F@lYkfezuOwO8s7OXvH8nT1W2
zmK=*6L*`w#Rc;nKdf&`@du=Uu+7y`m-_fzYab@i=^x{EjlZtNGG*(sF>a|OF2PY`0
z7Ts1VuM=UsN)TLI7+~RMr8S&Sf<?*JYD)}=$2_GoF8%TQtv>lp+p<vwFZM@T#lDL|
zX~dljl{=e<Ko&JFHyTb~@9Ba3DNH_vW_zo!ly~|x0Z7g<L6M{QeG4t4<Pz`u`O|#k
z326^M-04&nHz0G?V8+Xmd&-uEBS4bA49wSV?g@Mo4SsMbE>p=f#(sgjzCt8R!`-U*
z)kQ;tcY=GTjQ!j}T}d;-9_x~&;16)xM#-J0a*G@t3ks)Fc;_9vljDt!c6S0*)+T?w
z8lUUuV9&Ns>sM6^rFqenz(V@&NKB5OY{Z3IW0{cY<A4Gn^5Rjr&pP)}sXf{Jk{9(q
z&Pau*3|##R6i|3AuzI>Skmj7@1+(FpoS=0sG?+h|T^Y!PaDz24L-&GOmrtTANYmyt
z^_Xf?QqnLmpuR_de2i5Gi%Kpl`Tf;M)J$a{6~cW2*hy984~g1g>33;LSeCf&Y}-aY
znt!;Jd-Z4z;}ngEsL*uxS?I^@Kf|!D#DJ0u`61O|a~VJ;-xKA_%nZOd+!idXtPeIy
zobUSZ2{j3JRsM(w(59m!p1xkA7wqg@DpY+HlSEs>CXm8eY1o83_ABX=#ph!UGcq&L
z3`Rm3HG9CD=)(&GMm7wc0U+$0V_S68ANg#ktB_{CE}|XG3wfWAz@ZpgHnOhtLjM{Q
zxLVk&>T0f+y;E4vjG~sG(1MZ<fC(}^YU&FD*Rl)*cx)uAY#erg23ya~&5elptqtjh
zTQke}Av1DvTq@Yr)YbdO3h{#At!iUoWu+(~oxGp~hxeIDrkR;4*Rdp-1A%LM%~(TC
zZZ1>?4$rKuJ#T4YQI#hMYX(e}&%%<w2#lu2)#Hx^%Rs#s=-PFxE7G$*T_xG~$AF9?
zVvhzllGeopfCuc{4Tb~gqHA^E`k!4f$fw++0wV{YBxNW4iPAo$aNyo=mi24Yh$HO^
zTvS{O#B(^Uh#GzNEm`79PrwsZj~1UM1@B_Ab}@H~D_HPIIHKy2@Q$mN{<%7z<&65t
zRREVLSJVWxS#QFY$>UbjKDFm;bKaZ4_UYB|&eTj5G{|%PdqKB)7HDthhfDL`n5lT@
zPmkaWWC7Xe2H*nublf5Xq>;0mn~HQ!M;GY6Ly<W7*$c(pXB^x;o6TONIMj)*m1WY;
zY3`E35uZW7C&xN(Z<kzeQ2xFVoy)jxtj;epF*r0-{_G!M0MLm*amtan*b>F+s50&P
z9{Cn1-U+uj3EOm6MBjSyRRYsnW#!cpwmDS&^c+xY6fG>Q@IO>qIs|vi<o0b*PbB&A
zMl%XSMuA&M-+u5@Kt=ot56aKauhS<TmQ?8C-euO~>r#iUJ0g@O!3D<okA_TUO8Y-o
z!`w=-3BV!+S~a?$fh2j(!qSr2-}XD`zk-RKdoaVd#T_GGN!iid*nZ#rys^N|cC*<Q
zp@a^9RnZ}jhRbVl`_lBc1Vq^Z#%Yk>FISWyE-ntVw?MrB(`Eg6+Q>UyidEl)Q#!Uw
z>|Wa`r;oZDn5Wi5V>0aL#^*yf-0pWAx=$Cg?KJ;sjF@m>b4y90u{eVI0H%sa1Z8*E
zNGcMNOXpTvayJk$t|eFzy*#~#r9X-ZFyfM4Nd5O^PV(*mtMCkApPlYzRfw3v=wjUQ
z4m(wmg{gyahV~T|8Y-weK`jAa02)`*fj^l{;PDQ&c@kt5gyqR*>8zb0pvXL=L4lg)
z8NR-C*Z(FaX-#7WL{dYyJ==pc3vNq%pzjm-f*4Tb%&ZH8G=bav&Jp-OLl9rCe-r(w
zdw@H{7tn)?y8tfNs=yW~F3Za$vnSQcoO&Az|8p@Q)wgTP;u=Gx^nEQG&GrB;kMjSA
zhfxkNd7z`R#%ZB@`;yn2J5zXCKDMD8pyCWpcul$_57KG7XXAkRAJ1h-tgk2lVPC_N
z67<syMg8xm2Zw*G6ciLzGPi&Qr2LYk(B$rOr-us(3)lXkeBNEToy5P)pE4W1P?o2h
zckv%_<#!%U5e2_H+xyeRbJ?4&&#ccNcERu;waED>|ArZS351H>U#mGa(UNq?Ye@6$
zc(vlx0uT&S_{I91e1H8)!C3U4EISKaatkGuNl((#PXW?O^{;>26Wx)p%-XfL&<oxe
z*YEE>iX~b{APZ>uiI-^~Z(pXU5RDCz^4iYcUgA#vZ3|o5{Q8>|(BXLT3?oU+P5LIS
zuC6|-HeElx%S|In>5gnH55em}@!uH-CAbdIC}(?nWFN`?X0PTgHP6}31gD`-pKLCh
zYkuYfyU%KVetz~~ck3c{g-E2lK2qQo2u2__nZcTGxnQwv$y3`)$)qk&4u4$0{KGsr
z_qDWWcIvSjMoODnTR-q+uP86KbSjjlwX&9D_I@mLUtsU+W@SCa^YS(=7~%lW2hg1A
z-W~X$UrXNTt1K^12eI!uG7sr5?l#ew3@B&I_a+$T&}zomv=ehzE*XgqbeF&DniQJ0
zINq5g2Jl?r^e8bf&`tr$^`xkK_R2(-2v2~D(dT5ndd2osbaOKba5>}~_@*ApojaG^
zLgx_xuxV;i(doOuZ*%W>X$eC0|KqH{hNn@g0s(W(KX{CBr#09kG>v{PM#|SP@^}6r
zjsquBrw&8WULBlTHUR-6`pSg0W)QT^H>eFKFZ$}Ak(D)oX$NO_q$h#4H@@!3I+w@<
z=)fzTKmSN1?eh2DZUV!|BENRMamYaAb#bN`z>`Q4Y@Q9qB{RJQ-NnM5o*r5)Eu;E;
zl-oXq_+D%1l=uyp9+*KnsyG4^#L{EiSjGt7fqN(Z>+Y!1H!(I&mT9Tus4zD+w#AC>
zgbR#*|L!&+I;Y`pB$t+`dz=Z#@cu7@1~CkvEi4I!<(t1&t#%LpG}QR)9PDj(H_nfY
zJbF=C*$t>G;J~KSpo)@ge-E}22flv&@b{qaFUHrm7DxyUfaSYd_Gqgb2(6#T$IpQ#
zcP4mhG}0e9>sD8iOu<INC&|<JgCN0}Q~$fAKG*bjziF=NaJfkm4!^dyzdr{U0E5O>
z2M4>?!F*606j@3;C=8!^$Uzd=WT2-lUzvYaLIN$K9&-Prwh1$h<Jck(=m-Js5IJH#
zHw9epZz>oGEG;jm0(u6<%q)Fr^|6|lj^5R)bAWJGGz1Qx7&zXZ+ds_Iycdl+eQY4#
zl9RcXUH|*vczAeHva{>a6zY1@-@{Sfw$Q)(--}BAbc7y6@7~`2D-Q*~vEMY0=yiGT
z-UHrq<qd5djfS`<Pt=1`9`-$%+kfK*%eyNcrV{5eBXaxvdHp^W=ptP^?o2|oA9Tqg
zY%}D1f^xTOu0ZLi(Dokn@U2>}aDu4E*hMIfM9JI=dWUlW9$2B7!4xS->Q=rXCJcOr
zckX+e{%~<Ad{Lk!mzJ*UW&aGRgg?<zV-8deb4x2P#_l~xXPFsUhz~TqT_^UYp}}GI
ztL*M7#G3du&Z)0pdqlZZ9y$G}OHW7%IiI+^JjgXVIaW+~^Kdic1lGIWBk1b&RAhGE
z`Ss;lTJzEmXVIIBlo?-Led)~fIyFiFUQk}x7Q|7v(>eL{o7qYDf7S|6aZvS;F%d=m
z*Uc{Y9U<8`9e+79Q;eYw;g0A9$&Obq^)Gr(hRrU_V!Y6iFB(JMy1==xH~p?e^8$q7
zujWY46{_tA#fq{uM&kgRGy$vxUTDYvPLRAtTB0y*j7A@+`Yv>*m%Mp{clA%;P62fo
z@j;>Dq342d$JF0z{Jfp-A7Au+EvLmvXBoIbf+{1o^k>viN=?o)uj~Hi!bY4PD$F@J
zb(gkis@Wctvm}V5&zG4SxG9K$&;j8-u3!3z{w}vO^*ombXoyQJyCz!(?3&04=J8VK
zr@w^m*Xo~G=oK6US((i7Ve^o^*K9%)Qe^R&sp6^Zn(uYCtbCOF_dHD;*{^X-WOEmZ
zqup<^RflK(cJ%rBlj_O7UOzK$;J-H;vs9BOdrtY->u&12Sj3TOg4ea#`9~3~u-2NX
z@aZ5X89ZN)dZ^qfo#2Fn?|-v*kSpQ@Y7+dhI=o)Ta;oOt&6_C#US6K1jbpqswlhMM
zEn`q?;UNN4ZZ{R|eAbOADaRNEhH0CFv)td=Y|F|jGFl0$PcK45NZdk4u05FFuvZKG
zktX8^k&DllS^p@*axdrdjcC^!L~gvh_ubQX3{NF!56$?X8K#c5><8G5t>?osAbA1L
zI0D`*zHRXPxGKP2-GT$pW}0PvQ^)I-CALj^hHPGW3$Z+CWaTn6=MBPRm`{66b)O93
z6``)BTWjd-kLMbf#GVeZ!FQK4;e&&K-@^=}9P5$pQEtq-^HAVS<glSIiJKW0w#af;
z9((vZR7K2UODEgS&nMe1V$B5S{ET4E*vF9vW%yYLE07=zqo|)A#CU+oD+Bv@xnSQH
z?JJBVMWnn<Lbq**WJOFh5{DyKUCw)?(9L>{f8oVhc#eG{1he85QDM%6pg`wP0t=)m
z=4VhUbesaob1=r{<*FcUmCbohg+b6&l_xqnW=>wGE%GS7u(()yNweg|%a;lio-g5@
z-nBK^n#U61CZ>gS3r|n*Va4$bzB7A1Uszq9S7xIB9==iI@Ed>>Z&V}v9}sVTh~X&`
zGl);LGXHk6gpq93Z!mHX7k-+R!aZ@P8irl$_1+9}?ftn~B`RJLhKuGw6VLvLP-tZh
zI-ur{DN;luViO6BJL^_g+ClvY(S&Na%iXGj++ahLYi5szjQ_N6JqfZHzVkfn5xUfu
z(N*J03<m2W4;hf}ySx_kxwI!)8@2T>h7F^<CkvZdZ&_PbUsA)}T#Oh$_nR1&8SQ~$
zn0m@)^P`!5D`au+R^a~NSWzTGGmROg(U*6*rdEd^eT3_h^BAKK{&b53rJ6kxo@3p;
z@o&#DcA{fXn-mL*PtLvEAhl`j0*Ov`>e>l*RP&wvXM_c>Vcb-!m}@Z`=dq63*RMOl
zn>k)cWY`DYBOi0SNopl*L*dEe$2DsrEaW|5uz}hjs52W+wK%NP^zOru#Vjl<a=P-)
zIAbO)8RbT_cjX#Ck%xhECSmbWlqwyQBn7e)RIHtK2HV@0!&RutiBgTl*b$v2vrLY1
z;eV4Fc#{jM7-MyY6$<D!fjifDp5dsFeVPS|H}T{}$Anee%TV&6eDjG3#>R6XCz%)?
zmN!^!t(L!!-hpA)w%X&GC=h9DHiUmDQh!IXf|JwGpRl2SrepX7Nft(=vU!BY@1iv1
zYkw!sIcTbWdKh!J@7S}ThNB`<5rJYlCm%e3<z;WOP34pQ30bmCeGmtnEwM&CSMbmt
z8A?3&BfRsbcdOlZGHk6*r7J9;VO;iK(D$fnY=m-a$L@w<s@SO!1al(8gf-!*#$ro&
zC#FZD(GKSec)Udzx&r^m%+lMU6Gb9;(wCu87acp&=+<hE%HZH*8>}eZefjfDli9X(
z$lj<dn+uv|+HHfwxq~NTWw@y?AW>>a)w>VInel?*vVucjw1sxi1JVp9lJmP}OiK`G
z?^d~UayPBsgbO~4<Nbp6?o-MY6xZXOiCPqCQ{tWrr+dLb7k*a0qBt<SAJiS1M0y-y
zk&HKzsf6e@93|-|ryu`jFJ?zwY>65EQhe>BYk$+>UU%aJKyTKc#EQ2|rVF+xYN^~)
zg?LB!`*p<c+j)|$YWbPqczRNVfAkqKM(ZS10qdvsgh{*5RM@Ou*3k;TSA}i7icD)K
zTD!d>E@(1cjf?H^$9LZlV`F&!XWqc8k>k3|SZ~x2Q*~6w`H-E88Xs2TnTX&j&b-3Q
zA0=}I?a0T;2{6LW!-XRC(4btKHHpS499d5W#Qy0cEyeA>#0Z$ihXRTkX);<yt7wHa
z_vEL3Y*QvYzhHUW1eHiI_&IjXI0lAS_&gh!8|iA`t*ki!Q7+w#YWZ}DDH*?$o|%4X
zhpqqmTwB)6cDv4(WwgpEGCzW_Fq=MAZL1IOpo()<ZH-V9zHW0-B5ec<E=FcrdTo%F
z9HvDUE0iR(x3=cKjpYU-*?4xt&(-Q&n#yk3Z>?A5$4afmEt3+O;vcZgLbZqFDG=+n
zGvm<SWtB#U0cM8)7hLUp@WcJ#@#1!6<7f*2(E<;IAxG?p&aqFol(2`-WjRptn8tDn
zr0jZ~PkM`0y#wwpl_gyeOZNWov$Kj*vy=jvNxdp}ox@u`{pm+)3gix5C8G$GfsSVi
zCJzalY4`Px(-icUe*#&6J!73etoNxQ={p|L_o&W}W&axm0z)f4lqlb*G6vWIy+V0#
zkOQSH(nUE%ds<hqEj*7|ry5OFPYGw8P7JQQjEBrcn3pDQOwrR{*MnHlBeas($U0vc
z_RY{nWe;C24x!D@;e{sPTK&6FaZtJ9A&eGWbXaKP1tt-ac6#wKuIqWQU-te*?s>2j
zcUe@FU`rgu$L2wM95x0vs5a1Wt~Fdn6m#kL(FmqtN1_acHFe3%oW#-IFJ=lU&r9HF
zkTVqf4N>iJ!V9pt8I04@dDT?(in!o$6UuARGn!o_%czYp)6e&ziI~BAt*Mdnt!1r<
zT>=h8kq^JkI9^!O-VupCj;jsmHBLLm+zksm&3Ks!@-fzfg2O}pz1pGx{ooOau^BBT
ztn65_Als%Ciy6<M{)&yyRK!C%E(5{ESOTV70iByB2&5Z|^O-7S(P}-0m+v(M*MSBD
z3&Eo}CHqn4OX<(gco~Yc{~?8IK=p54ndBhL^&g9C%<nZrOnzuyrqn&ofkk{(dl%!C
z)XpA$p(Ij-`i#CgFL0Bh&+@b)x>S7e!dH|4qBcj!C*Gb4{aG>ipAEuFEdo%&e)Jug
z&9s(=qkU`$O@Y%HI8Rnb<4GKpwfalqV+HKQz3SUNPC=y()-imyPS6Q=$BFWML+o%w
zlw9*C9;fg*a7e!lL|wWH00p#sUQAf&JGE%?n}d^6cW|qfiFN!GS$NzC`{bLMs=8Z1
z9K`Z0G@j|p9U}YtKa-Dbp`7FKf|;##V&DFgydOcJR2Dy^N`G9_Ckiwoae<5H+v;wp
z8dH4ZPqjd7Ue(pzO@N*8X!B-gvPF`F;dLrE;xt4|^wIB!#mSdG82(G+j`dtzSzMIw
z*yRvG-u3m+6azB+9&eW{*Z$E_mlINp_7_cRV0Vvql$HwrhJSu-J01M8fo00WuI1t&
z-^$WT8Wzp;<b<Z7@4pH~Fw7lRDW%0W6FrCV%E)vw%<33^@<l9YI2wT>-o1W3b%~jj
z!`uIS|JW=)sU*G*Gz0;?rdd#oj6sNc`1pK{m-kUzX+>mlbGhyv+W=aN{}q!yq4O`J
YP8#Fo`lzlNz|KFSt8J)Np=lHGKNE;7S^xk5

literal 0
HcmV?d00001


From cead11206b73272a77e1c62eda6f4ff7eca45db3 Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 01:31:39 +0800
Subject: [PATCH 3/9] auto commit

---
 docs/notes/Java 基础.md | 1 -
 notes/Java 基础.md      | 1 -
 2 files changed, 2 deletions(-)

diff --git a/docs/notes/Java 基础.md b/docs/notes/Java 基础.md
index 409c1e75..e81b46a7 100644
--- a/docs/notes/Java 基础.md	
+++ b/docs/notes/Java 基础.md	
@@ -1420,7 +1420,6 @@ Java 注解是附加在代码中的一些元信息，用于一些工具在编译
 - Java 不支持多重继承，只能通过实现多个接口来达到相同目的，而 C++ 支持多重继承。
 - Java 不支持操作符重载，虽然可以对两个 String 对象执行加法运算，但是这是语言内置支持的操作，不属于操作符重载，而 C++ 可以。
 - Java 的 goto 是保留字，但是不可用，C++ 可以使用 goto。
-- Java 不支持条件编译，C++ 通过 #ifdef #ifndef 等预处理命令从而实现条件编译。
 
 [What are the main differences between Java and C++?](http://cs-fundamentals.com/tech-interview/java/differences-between-java-and-cpp.php)
 
diff --git a/notes/Java 基础.md b/notes/Java 基础.md
index dc943c68..4198ac4d 100644
--- a/notes/Java 基础.md	
+++ b/notes/Java 基础.md	
@@ -1420,7 +1420,6 @@ Java 注解是附加在代码中的一些元信息，用于一些工具在编译
 - Java 不支持多重继承，只能通过实现多个接口来达到相同目的，而 C++ 支持多重继承。
 - Java 不支持操作符重载，虽然可以对两个 String 对象执行加法运算，但是这是语言内置支持的操作，不属于操作符重载，而 C++ 可以。
 - Java 的 goto 是保留字，但是不可用，C++ 可以使用 goto。
-- Java 不支持条件编译，C++ 通过 #ifdef #ifndef 等预处理命令从而实现条件编译。
 
 [What are the main differences between Java and C++?](http://cs-fundamentals.com/tech-interview/java/differences-between-java-and-cpp.php)
 

From 092fef5d608ff3a22078890223be55665cba1948 Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 01:34:50 +0800
Subject: [PATCH 4/9] auto commit

---
 docs/notes/Leetcode 题解 - 动态规划.md | 18 ++++++++++--------
 notes/Leetcode 题解 - 动态规划.md      | 18 ++++++++++--------
 2 files changed, 20 insertions(+), 16 deletions(-)

diff --git a/docs/notes/Leetcode 题解 - 动态规划.md b/docs/notes/Leetcode 题解 - 动态规划.md
index c556ee0f..fd51bf13 100644
--- a/docs/notes/Leetcode 题解 - 动态规划.md	
+++ b/docs/notes/Leetcode 题解 - 动态规划.md	
@@ -869,18 +869,20 @@ return -1.
 
 ```java
 public int coinChange(int[] coins, int amount) {
-public int change(int amount, int[] coins) {
-    if (coins == null) {
-        return 0;
-    }
     int[] dp = new int[amount + 1];
-    dp[0] = 1;
     for (int coin : coins) {
-        for (int i = coin; i <= amount; i++) {
-            dp[i] += dp[i - coin];
+        for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历
+            if (i == coin) {
+                dp[i] = 1;
+            } else if (dp[i] == 0 && dp[i - coin] != 0) {
+                dp[i] = dp[i - coin] + 1;
+
+            } else if (dp[i - coin] != 0) {
+                dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+            }
         }
     }
-    return dp[amount];
+    return dp[amount] == 0 ? -1 : dp[amount];
 }
 ```
 
diff --git a/notes/Leetcode 题解 - 动态规划.md b/notes/Leetcode 题解 - 动态规划.md
index a0a50a4a..c7c6b8ce 100644
--- a/notes/Leetcode 题解 - 动态规划.md	
+++ b/notes/Leetcode 题解 - 动态规划.md	
@@ -869,18 +869,20 @@ return -1.
 
 ```java
 public int coinChange(int[] coins, int amount) {
-public int change(int amount, int[] coins) {
-    if (coins == null) {
-        return 0;
-    }
     int[] dp = new int[amount + 1];
-    dp[0] = 1;
     for (int coin : coins) {
-        for (int i = coin; i <= amount; i++) {
-            dp[i] += dp[i - coin];
+        for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历
+            if (i == coin) {
+                dp[i] = 1;
+            } else if (dp[i] == 0 && dp[i - coin] != 0) {
+                dp[i] = dp[i - coin] + 1;
+
+            } else if (dp[i - coin] != 0) {
+                dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+            }
         }
     }
-    return dp[amount];
+    return dp[amount] == 0 ? -1 : dp[amount];
 }
 ```
 

From 63b4122c46247e88cd914c9a2a24be6893cacca5 Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 01:39:44 +0800
Subject: [PATCH 5/9] auto commit

---
 docs/notes/剑指 Offer 题解 - 10~19.md | 2 +-
 notes/剑指 Offer 题解 - 10~19.md      | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/docs/notes/剑指 Offer 题解 - 10~19.md b/docs/notes/剑指 Offer 题解 - 10~19.md
index 458af00e..e5d65231 100644
--- a/docs/notes/剑指 Offer 题解 - 10~19.md	
+++ b/docs/notes/剑指 Offer 题解 - 10~19.md	
@@ -154,7 +154,7 @@ public int JumpFloor(int n) {
     if (n <= 2)
         return n;
     int pre2 = 1, pre1 = 2;
-    int result = 1;
+    int result = 0;
     for (int i = 2; i < n; i++) {
         result = pre2 + pre1;
         pre2 = pre1;
diff --git a/notes/剑指 Offer 题解 - 10~19.md b/notes/剑指 Offer 题解 - 10~19.md
index 57c4cd70..1a05a88a 100644
--- a/notes/剑指 Offer 题解 - 10~19.md	
+++ b/notes/剑指 Offer 题解 - 10~19.md	
@@ -154,7 +154,7 @@ public int JumpFloor(int n) {
     if (n <= 2)
         return n;
     int pre2 = 1, pre1 = 2;
-    int result = 1;
+    int result = 0;
     for (int i = 2; i < n; i++) {
         result = pre2 + pre1;
         pre2 = pre1;

From cac408908ff63ad4c425b59d198bac588bd0ecb4 Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 01:58:26 +0800
Subject: [PATCH 6/9] auto commit

---
 docs/notes/Leetcode 题解 - 搜索.md | 18 ++++++++++--------
 notes/Leetcode 题解 - 搜索.md      | 18 ++++++++++--------
 2 files changed, 20 insertions(+), 16 deletions(-)

diff --git a/docs/notes/Leetcode 题解 - 搜索.md b/docs/notes/Leetcode 题解 - 搜索.md
index 4fd9504b..2e0729e9 100644
--- a/docs/notes/Leetcode 题解 - 搜索.md	
+++ b/docs/notes/Leetcode 题解 - 搜索.md	
@@ -61,6 +61,8 @@
 
 ## 1. 计算在网格中从原点到特定点的最短路径长度
 
+[1091. Shortest Path in Binary Matrix(Medium)](https://leetcode.com/problems/shortest-path-in-binary-matrix/)
+
 ```html
 [[1,1,0,1],
  [1,0,1,0],
@@ -68,12 +70,12 @@
  [1,0,1,1]]
 ```
 
-题目描述：1 表示可以经过某个位置，求解从 (0, 0) 位置到 (tr, tc) 位置的最短路径长度。
+题目描述：0 表示可以经过某个位置，求解从左上角到右下角的最短路径长度。
 
 ```java
-public int minPathLength(int[][] grids, int tr, int tc) {
-    final int[][] direction = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
-    final int m = grids.length, n = grids[0].length;
+public int shortestPathBinaryMatrix(int[][] grids) {
+    int[][] direction = {{1, -1}, {1, 0}, {1, 1}, {0, -1}, {0, 1}, {-1, -1}, {-1, 0}, {-1, 1}};
+    int m = grids.length, n = grids[0].length;
     Queue<Pair<Integer, Integer>> queue = new LinkedList<>();
     queue.add(new Pair<>(0, 0));
     int pathLength = 0;
@@ -83,14 +85,14 @@ public int minPathLength(int[][] grids, int tr, int tc) {
         while (size-- > 0) {
             Pair<Integer, Integer> cur = queue.poll();
             int cr = cur.getKey(), cc = cur.getValue();
-            grids[cr][cc] = 0; // 标记
+            grids[cr][cc] = 1; // 标记
             for (int[] d : direction) {
                 int nr = cr + d[0], nc = cc + d[1];
-                if (nr < 0 || nr >= m || nc < 0 || nc >= n || grids[nr][nc] == 0) {
+                if (nr < 0 || nr >= m || nc < 0 || nc >= n || grids[nr][nc] == 1) {
                     continue;
                 }
-                if (nr == tr && nc == tc) {
-                    return pathLength;
+                if (nr == m - 1 && nc == n - 1) {
+                    return pathLength + 1;
                 }
                 queue.add(new Pair<>(nr, nc));
             }
diff --git a/notes/Leetcode 题解 - 搜索.md b/notes/Leetcode 题解 - 搜索.md
index 0437af64..38945d90 100644
--- a/notes/Leetcode 题解 - 搜索.md	
+++ b/notes/Leetcode 题解 - 搜索.md	
@@ -61,6 +61,8 @@
 
 ## 1. 计算在网格中从原点到特定点的最短路径长度
 
+[1091. Shortest Path in Binary Matrix(Medium)](https://leetcode.com/problems/shortest-path-in-binary-matrix/)
+
 ```html
 [[1,1,0,1],
  [1,0,1,0],
@@ -68,12 +70,12 @@
  [1,0,1,1]]
 ```
 
-题目描述：1 表示可以经过某个位置，求解从 (0, 0) 位置到 (tr, tc) 位置的最短路径长度。
+题目描述：0 表示可以经过某个位置，求解从左上角到右下角的最短路径长度。
 
 ```java
-public int minPathLength(int[][] grids, int tr, int tc) {
-    final int[][] direction = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
-    final int m = grids.length, n = grids[0].length;
+public int shortestPathBinaryMatrix(int[][] grids) {
+    int[][] direction = {{1, -1}, {1, 0}, {1, 1}, {0, -1}, {0, 1}, {-1, -1}, {-1, 0}, {-1, 1}};
+    int m = grids.length, n = grids[0].length;
     Queue<Pair<Integer, Integer>> queue = new LinkedList<>();
     queue.add(new Pair<>(0, 0));
     int pathLength = 0;
@@ -83,14 +85,14 @@ public int minPathLength(int[][] grids, int tr, int tc) {
         while (size-- > 0) {
             Pair<Integer, Integer> cur = queue.poll();
             int cr = cur.getKey(), cc = cur.getValue();
-            grids[cr][cc] = 0; // 标记
+            grids[cr][cc] = 1; // 标记
             for (int[] d : direction) {
                 int nr = cr + d[0], nc = cc + d[1];
-                if (nr < 0 || nr >= m || nc < 0 || nc >= n || grids[nr][nc] == 0) {
+                if (nr < 0 || nr >= m || nc < 0 || nc >= n || grids[nr][nc] == 1) {
                     continue;
                 }
-                if (nr == tr && nc == tc) {
-                    return pathLength;
+                if (nr == m - 1 && nc == n - 1) {
+                    return pathLength + 1;
                 }
                 queue.add(new Pair<>(nr, nc));
             }

From 4b95034db3becf10818e0aed77d57304e8bcd7c6 Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 02:06:42 +0800
Subject: [PATCH 7/9] auto commit

---
 docs/notes/Leetcode 题解 - 位运算.md | 4 ++--
 notes/Leetcode 题解 - 位运算.md      | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/docs/notes/Leetcode 题解 - 位运算.md b/docs/notes/Leetcode 题解 - 位运算.md
index d4c659b7..a89999ad 100644
--- a/docs/notes/Leetcode 题解 - 位运算.md	
+++ b/docs/notes/Leetcode 题解 - 位运算.md	
@@ -47,9 +47,9 @@ x ^ x = 0       x & x = x       x | x = x
 
 要得到只有第 i 位为 1 的 mask，将 1 向左移动 i-1 位即可，1&lt;&lt;(i-1) 。例如 1&lt;&lt;4 得到只有第 5 位为 1 的 mask ：00010000。
 
-要得到 1 到 i 位为 1 的 mask，1&lt;&lt;(i+1)-1 即可，例如将 1&lt;&lt;(4+1)-1 = 00010000-1 = 00001111。
+要得到 1 到 i 位为 1 的 mask，(1&lt;&lt;i)-1 即可，例如将 (1&lt;&lt;4)-1 = 00010000-1 = 00001111。
 
-要得到 1 到 i 位为 0 的 mask，只需将 1 到 i 位为 1 的 mask 取反，即 \~(1&lt;&lt;(i+1)-1)。
+要得到 1 到 i 位为 0 的 mask，只需将 1 到 i 位为 1 的 mask 取反，即 \~((1&lt;&lt;i)-1)。
 
 **Java 中的位操作** 
 
diff --git a/notes/Leetcode 题解 - 位运算.md b/notes/Leetcode 题解 - 位运算.md
index d4c659b7..a89999ad 100644
--- a/notes/Leetcode 题解 - 位运算.md	
+++ b/notes/Leetcode 题解 - 位运算.md	
@@ -47,9 +47,9 @@ x ^ x = 0       x & x = x       x | x = x
 
 要得到只有第 i 位为 1 的 mask，将 1 向左移动 i-1 位即可，1&lt;&lt;(i-1) 。例如 1&lt;&lt;4 得到只有第 5 位为 1 的 mask ：00010000。
 
-要得到 1 到 i 位为 1 的 mask，1&lt;&lt;(i+1)-1 即可，例如将 1&lt;&lt;(4+1)-1 = 00010000-1 = 00001111。
+要得到 1 到 i 位为 1 的 mask，(1&lt;&lt;i)-1 即可，例如将 (1&lt;&lt;4)-1 = 00010000-1 = 00001111。
 
-要得到 1 到 i 位为 0 的 mask，只需将 1 到 i 位为 1 的 mask 取反，即 \~(1&lt;&lt;(i+1)-1)。
+要得到 1 到 i 位为 0 的 mask，只需将 1 到 i 位为 1 的 mask 取反，即 \~((1&lt;&lt;i)-1)。
 
 **Java 中的位操作** 
 

From dec684a9a66a198182706e67d30caa28b8436b2a Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 02:15:15 +0800
Subject: [PATCH 8/9] auto commit

---
 docs/notes/剑指 Offer 题解 - 10~19.md | 22 +++++++++++-----------
 docs/notes/剑指 Offer 题解 - 20~29.md | 20 ++++++++++----------
 docs/notes/剑指 Offer 题解 - 30~39.md | 24 ++++++++++++------------
 docs/notes/剑指 Offer 题解 - 3~9.md   | 14 +++++++-------
 docs/notes/剑指 Offer 题解 - 40~49.md | 14 +++++++-------
 docs/notes/剑指 Offer 题解 - 50~59.md | 26 +++++++++++++-------------
 docs/notes/剑指 Offer 题解 - 60~68.md | 12 ++++++------
 notes/剑指 Offer 题解 - 10~19.md      | 22 +++++++++++-----------
 notes/剑指 Offer 题解 - 20~29.md      | 20 ++++++++++----------
 notes/剑指 Offer 题解 - 30~39.md      | 24 ++++++++++++------------
 notes/剑指 Offer 题解 - 3~9.md        | 14 +++++++-------
 notes/剑指 Offer 题解 - 40~49.md      | 14 +++++++-------
 notes/剑指 Offer 题解 - 50~59.md      | 26 +++++++++++++-------------
 notes/剑指 Offer 题解 - 60~68.md      | 12 ++++++------
 14 files changed, 132 insertions(+), 132 deletions(-)

diff --git a/docs/notes/剑指 Offer 题解 - 10~19.md b/docs/notes/剑指 Offer 题解 - 10~19.md
index e5d65231..7f1848ba 100644
--- a/docs/notes/剑指 Offer 题解 - 10~19.md	
+++ b/docs/notes/剑指 Offer 题解 - 10~19.md	
@@ -18,7 +18,7 @@
 
 # 10.1 斐波那契数列
 
-[NowCoder](https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -86,7 +86,7 @@ public class Solution {
 
 # 10.2 矩形覆盖
 
-[NowCoder](https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -127,7 +127,7 @@ public int RectCover(int n) {
 
 # 10.3 跳台阶
 
-[NowCoder](https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tqId=11161&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tqId=11161&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -166,7 +166,7 @@ public int JumpFloor(int n) {
 
 # 10.4 变态跳台阶
 
-[NowCoder](https://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387?tpId=13&tqId=11162&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387?tpId=13&tqId=11162&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -226,7 +226,7 @@ public int JumpFloorII(int target) {
 
 # 11. 旋转数组的最小数字
 
-[NowCoder](https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -292,7 +292,7 @@ private int minNumber(int[] nums, int l, int h) {
 
 # 12. 矩阵中的路径
 
-[NowCoder](https://www.nowcoder.com/practice/c61c6999eecb4b8f88a98f66b273a3cc?tpId=13&tqId=11218&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/c61c6999eecb4b8f88a98f66b273a3cc?tpId=13&tqId=11218&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -357,7 +357,7 @@ private char[][] buildMatrix(char[] array) {
 
 # 13. 机器人的运动范围
 
-[NowCoder](https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -469,7 +469,7 @@ public int integerBreak(int n) {
 
 # 15. 二进制中 1 的个数
 
-[NowCoder](https://www.nowcoder.com/practice/8ee967e43c2c4ec193b040ea7fbb10b8?tpId=13&tqId=11164&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8ee967e43c2c4ec193b040ea7fbb10b8?tpId=13&tqId=11164&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -510,7 +510,7 @@ public int NumberOf1(int n) {
 
 # 16. 数值的整数次方
 
-[NowCoder](https://www.nowcoder.com/practice/1a834e5e3e1a4b7ba251417554e07c00?tpId=13&tqId=11165&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1a834e5e3e1a4b7ba251417554e07c00?tpId=13&tqId=11165&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -626,7 +626,7 @@ public ListNode deleteNode(ListNode head, ListNode tobeDelete) {
 
 # 18.2 删除链表中重复的结点
 
-[NowCoder](https://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -652,7 +652,7 @@ public ListNode deleteDuplication(ListNode pHead) {
 
 # 19. 正则表达式匹配
 
-[NowCoder](https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/docs/notes/剑指 Offer 题解 - 20~29.md b/docs/notes/剑指 Offer 题解 - 20~29.md
index 0bb8675c..c19b6f4c 100644
--- a/docs/notes/剑指 Offer 题解 - 20~29.md	
+++ b/docs/notes/剑指 Offer 题解 - 20~29.md	
@@ -14,7 +14,7 @@
 
 # 20. 表示数值的字符串
 
-[NowCoder](https://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -64,7 +64,7 @@ public boolean isNumeric(char[] str) {
 
 # 21. 调整数组顺序使奇数位于偶数前面
 
-[NowCoder](https://www.nowcoder.com/practice/beb5aa231adc45b2a5dcc5b62c93f593?tpId=13&tqId=11166&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/beb5aa231adc45b2a5dcc5b62c93f593?tpId=13&tqId=11166&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -125,7 +125,7 @@ private void swap(int[] nums, int i, int j) {
 
 # 22. 链表中倒数第 K 个结点
 
-[NowCoder](https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -153,7 +153,7 @@ public ListNode FindKthToTail(ListNode head, int k) {
 
 # 23. 链表中环的入口结点
 
-[NowCoder](https://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -187,7 +187,7 @@ public ListNode EntryNodeOfLoop(ListNode pHead) {
 
 # 24. 反转链表
 
-[NowCoder](https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -224,7 +224,7 @@ public ListNode ReverseList(ListNode head) {
 
 # 25. 合并两个排序的链表
 
-[NowCoder](https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -276,7 +276,7 @@ public ListNode Merge(ListNode list1, ListNode list2) {
 
 # 26. 树的子结构
 
-[NowCoder](https://www.nowcoder.com/practice/6e196c44c7004d15b1610b9afca8bd88?tpId=13&tqId=11170&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6e196c44c7004d15b1610b9afca8bd88?tpId=13&tqId=11170&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -304,7 +304,7 @@ private boolean isSubtreeWithRoot(TreeNode root1, TreeNode root2) {
 
 # 27. 二叉树的镜像
 
-[NowCoder](https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -330,7 +330,7 @@ private void swap(TreeNode root) {
 
 # 28 对称的二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -358,7 +358,7 @@ boolean isSymmetrical(TreeNode t1, TreeNode t2) {
 
 # 29. 顺时针打印矩阵
 
-[NowCoder](https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/docs/notes/剑指 Offer 题解 - 30~39.md b/docs/notes/剑指 Offer 题解 - 30~39.md
index 6f949cde..8617c697 100644
--- a/docs/notes/剑指 Offer 题解 - 30~39.md	
+++ b/docs/notes/剑指 Offer 题解 - 30~39.md	
@@ -16,7 +16,7 @@
 
 # 30. 包含 min 函数的栈
 
-[NowCoder](https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -49,7 +49,7 @@ public int min() {
 
 # 31. 栈的压入、弹出序列
 
-[NowCoder](https://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106?tpId=13&tqId=11174&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106?tpId=13&tqId=11174&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -79,7 +79,7 @@ public boolean IsPopOrder(int[] pushSequence, int[] popSequence) {
 
 # 32.1 从上往下打印二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -117,7 +117,7 @@ public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
 
 # 32.2 把二叉树打印成多行
 
-[NowCoder](https://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&tqId=11213&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&tqId=11213&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -150,7 +150,7 @@ ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
 
 # 32.3 按之字形顺序打印二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -187,7 +187,7 @@ public ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
 
 # 33. 二叉搜索树的后序遍历序列
 
-[NowCoder](https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -222,7 +222,7 @@ private boolean verify(int[] sequence, int first, int last) {
 
 # 34. 二叉树中和为某一值的路径
 
-[NowCoder](https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -259,7 +259,7 @@ private void backtracking(TreeNode node, int target, ArrayList<Integer> path) {
 
 # 35. 复杂链表的复制
 
-[NowCoder](https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -327,7 +327,7 @@ public RandomListNode Clone(RandomListNode pHead) {
 
 # 36. 二叉搜索树与双向链表
 
-[NowCoder](https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -362,7 +362,7 @@ private void inOrder(TreeNode node) {
 
 # 37. 序列化二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -402,7 +402,7 @@ private TreeNode Deserialize() {
 
 # 38. 字符串的排列
 
-[NowCoder](https://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7?tpId=13&tqId=11180&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7?tpId=13&tqId=11180&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -443,7 +443,7 @@ private void backtracking(char[] chars, boolean[] hasUsed, StringBuilder s) {
 
 # 39. 数组中出现次数超过一半的数字
 
-[NowCoder](https://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163?tpId=13&tqId=11181&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163?tpId=13&tqId=11181&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
diff --git a/docs/notes/剑指 Offer 题解 - 3~9.md b/docs/notes/剑指 Offer 题解 - 3~9.md
index 9c13c2b7..5a9096ee 100644
--- a/docs/notes/剑指 Offer 题解 - 3~9.md	
+++ b/docs/notes/剑指 Offer 题解 - 3~9.md	
@@ -11,7 +11,7 @@
 
 # 3. 数组中重复的数字
 
-[NowCoder](https://www.nowcoder.com/practice/623a5ac0ea5b4e5f95552655361ae0a8?tpId=13&tqId=11203&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/623a5ac0ea5b4e5f95552655361ae0a8?tpId=13&tqId=11203&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -61,7 +61,7 @@ private void swap(int[] nums, int i, int j) {
 
 # 4. 二维数组中的查找
 
-[NowCoder](https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e?tpId=13&tqId=11154&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e?tpId=13&tqId=11154&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -109,7 +109,7 @@ public boolean Find(int target, int[][] matrix) {
 
 # 5. 替换空格
 
-[NowCoder](https://www.nowcoder.com/practice/4060ac7e3e404ad1a894ef3e17650423?tpId=13&tqId=11155&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/4060ac7e3e404ad1a894ef3e17650423?tpId=13&tqId=11155&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -158,7 +158,7 @@ public String replaceSpace(StringBuffer str) {
 
 # 6. 从尾到头打印链表
 
-[NowCoder](https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035?tpId=13&tqId=11156&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035?tpId=13&tqId=11156&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -237,7 +237,7 @@ public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
 
 # 7. 重建二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -276,7 +276,7 @@ private TreeNode reConstructBinaryTree(int[] pre, int preL, int preR, int inL) {
 
 # 8. 二叉树的下一个结点
 
-[NowCoder](https://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -327,7 +327,7 @@ public TreeLinkNode GetNext(TreeLinkNode pNode) {
 
 # 9. 用两个栈实现队列
 
-[NowCoder](https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6?tpId=13&tqId=11158&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6?tpId=13&tqId=11158&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/docs/notes/剑指 Offer 题解 - 40~49.md b/docs/notes/剑指 Offer 题解 - 40~49.md
index 7dc925fd..61bbc96d 100644
--- a/docs/notes/剑指 Offer 题解 - 40~49.md	
+++ b/docs/notes/剑指 Offer 题解 - 40~49.md	
@@ -15,7 +15,7 @@
 
 # 40. 最小的 K 个数
 
-[NowCoder](https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf?tpId=13&tqId=11182&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf?tpId=13&tqId=11182&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -97,7 +97,7 @@ public ArrayList<Integer> GetLeastNumbers_Solution(int[] nums, int k) {
 
 # 41.1 数据流中的中位数
 
-[NowCoder](https://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -138,7 +138,7 @@ public Double GetMedian() {
 
 # 41.2 字符流中第一个不重复的字符
 
-[NowCoder](https://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -164,7 +164,7 @@ public char FirstAppearingOnce() {
 
 # 42. 连续子数组的最大和
 
-[NowCoder](https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -188,7 +188,7 @@ public int FindGreatestSumOfSubArray(int[] nums) {
 
 # 43. 从 1 到 n 整数中 1 出现的次数
 
-[NowCoder](https://www.nowcoder.com/practice/bd7f978302044eee894445e244c7eee6?tpId=13&tqId=11184&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/bd7f978302044eee894445e244c7eee6?tpId=13&tqId=11184&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -262,7 +262,7 @@ private int getDigitAtIndex(int index, int place) {
 
 # 45. 把数组排成最小的数
 
-[NowCoder](https://www.nowcoder.com/practice/8fecd3f8ba334add803bf2a06af1b993?tpId=13&tqId=11185&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8fecd3f8ba334add803bf2a06af1b993?tpId=13&tqId=11185&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -388,7 +388,7 @@ public int longestSubStringWithoutDuplication(String str) {
 
 # 49. 丑数
 
-[NowCoder](https://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/docs/notes/剑指 Offer 题解 - 50~59.md b/docs/notes/剑指 Offer 题解 - 50~59.md
index a84cb37b..5f4f6d5f 100644
--- a/docs/notes/剑指 Offer 题解 - 50~59.md	
+++ b/docs/notes/剑指 Offer 题解 - 50~59.md	
@@ -17,7 +17,7 @@
 
 # 50. 第一个只出现一次的字符位置
 
-[NowCoder](https://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -67,7 +67,7 @@ public int FirstNotRepeatingChar2(String str) {
 
 # 51. 数组中的逆序对
 
-[NowCoder](https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -116,7 +116,7 @@ private void merge(int[] nums, int l, int m, int h) {
 
 # 52. 两个链表的第一个公共结点
 
-[NowCoder](https://www.nowcoder.com/practice/6ab1d9a29e88450685099d45c9e31e46?tpId=13&tqId=11189&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6ab1d9a29e88450685099d45c9e31e46?tpId=13&tqId=11189&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -141,7 +141,7 @@ public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
 
 # 53. 数字在排序数组中出现的次数
 
-[NowCoder](https://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2?tpId=13&tqId=11190&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2?tpId=13&tqId=11190&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -178,7 +178,7 @@ private int binarySearch(int[] nums, int K) {
 
 # 54. 二叉查找树的第 K 个结点
 
-[NowCoder](https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -206,7 +206,7 @@ private void inOrder(TreeNode root, int k) {
 
 # 55.1 二叉树的深度
 
-[NowCoder](https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -224,7 +224,7 @@ public int TreeDepth(TreeNode root) {
 
 # 55.2 平衡二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -255,7 +255,7 @@ private int height(TreeNode root) {
 
 # 56. 数组中只出现一次的数字
 
-[NowCoder](https://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -284,7 +284,7 @@ public void FindNumsAppearOnce(int[] nums, int num1[], int num2[]) {
 
 # 57.1 和为 S 的两个数字
 
-[NowCoder](https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -316,7 +316,7 @@ public ArrayList<Integer> FindNumbersWithSum(int[] array, int sum) {
 
 # 57.2 和为 S 的连续正数序列
 
-[NowCoder](https://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -360,7 +360,7 @@ public ArrayList<ArrayList<Integer>> FindContinuousSequence(int sum) {
 
 # 58.1 翻转单词顺序列
 
-[NowCoder](https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -408,7 +408,7 @@ private void swap(char[] c, int i, int j) {
 
 # 58.2 左旋转字符串
 
-[NowCoder](https://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -450,7 +450,7 @@ private void swap(char[] chars, int i, int j) {
 
 # 59. 滑动窗口的最大值
 
-[NowCoder](https://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/docs/notes/剑指 Offer 题解 - 60~68.md b/docs/notes/剑指 Offer 题解 - 60~68.md
index 2887629b..c1a36c82 100644
--- a/docs/notes/剑指 Offer 题解 - 60~68.md	
+++ b/docs/notes/剑指 Offer 题解 - 60~68.md	
@@ -86,7 +86,7 @@ public List<Map.Entry<Integer, Double>> dicesSum(int n) {
 
 # 61. 扑克牌顺子
 
-[NowCoder](https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -124,7 +124,7 @@ public boolean isContinuous(int[] nums) {
 
 # 62. 圆圈中最后剩下的数
 
-[NowCoder](https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -174,7 +174,7 @@ public int maxProfit(int[] prices) {
 
 # 64. 求 1+2+3+...+n
 
-[NowCoder](https://www.nowcoder.com/practice/7a0da8fc483247ff8800059e12d7caf1?tpId=13&tqId=11200&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/7a0da8fc483247ff8800059e12d7caf1?tpId=13&tqId=11200&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -198,7 +198,7 @@ public int Sum_Solution(int n) {
 
 # 65. 不用加减乘除做加法
 
-[NowCoder](https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -218,7 +218,7 @@ public int Add(int a, int b) {
 
 # 66. 构建乘积数组
 
-[NowCoder](https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -243,7 +243,7 @@ public int[] multiply(int[] A) {
 
 # 67. 把字符串转换成整数
 
-[NowCoder](https://www.nowcoder.com/practice/1277c681251b4372bdef344468e4f26e?tpId=13&tqId=11202&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1277c681251b4372bdef344468e4f26e?tpId=13&tqId=11202&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/notes/剑指 Offer 题解 - 10~19.md b/notes/剑指 Offer 题解 - 10~19.md
index 1a05a88a..7b2c78fe 100644
--- a/notes/剑指 Offer 题解 - 10~19.md	
+++ b/notes/剑指 Offer 题解 - 10~19.md	
@@ -18,7 +18,7 @@
 
 # 10.1 斐波那契数列
 
-[NowCoder](https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -86,7 +86,7 @@ public class Solution {
 
 # 10.2 矩形覆盖
 
-[NowCoder](https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -127,7 +127,7 @@ public int RectCover(int n) {
 
 # 10.3 跳台阶
 
-[NowCoder](https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tqId=11161&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tqId=11161&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -166,7 +166,7 @@ public int JumpFloor(int n) {
 
 # 10.4 变态跳台阶
 
-[NowCoder](https://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387?tpId=13&tqId=11162&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387?tpId=13&tqId=11162&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -226,7 +226,7 @@ public int JumpFloorII(int target) {
 
 # 11. 旋转数组的最小数字
 
-[NowCoder](https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -292,7 +292,7 @@ private int minNumber(int[] nums, int l, int h) {
 
 # 12. 矩阵中的路径
 
-[NowCoder](https://www.nowcoder.com/practice/c61c6999eecb4b8f88a98f66b273a3cc?tpId=13&tqId=11218&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/c61c6999eecb4b8f88a98f66b273a3cc?tpId=13&tqId=11218&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -357,7 +357,7 @@ private char[][] buildMatrix(char[] array) {
 
 # 13. 机器人的运动范围
 
-[NowCoder](https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -469,7 +469,7 @@ public int integerBreak(int n) {
 
 # 15. 二进制中 1 的个数
 
-[NowCoder](https://www.nowcoder.com/practice/8ee967e43c2c4ec193b040ea7fbb10b8?tpId=13&tqId=11164&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8ee967e43c2c4ec193b040ea7fbb10b8?tpId=13&tqId=11164&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -510,7 +510,7 @@ public int NumberOf1(int n) {
 
 # 16. 数值的整数次方
 
-[NowCoder](https://www.nowcoder.com/practice/1a834e5e3e1a4b7ba251417554e07c00?tpId=13&tqId=11165&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1a834e5e3e1a4b7ba251417554e07c00?tpId=13&tqId=11165&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -626,7 +626,7 @@ public ListNode deleteNode(ListNode head, ListNode tobeDelete) {
 
 # 18.2 删除链表中重复的结点
 
-[NowCoder](https://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -652,7 +652,7 @@ public ListNode deleteDuplication(ListNode pHead) {
 
 # 19. 正则表达式匹配
 
-[NowCoder](https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/notes/剑指 Offer 题解 - 20~29.md b/notes/剑指 Offer 题解 - 20~29.md
index 3f72f933..315b7527 100644
--- a/notes/剑指 Offer 题解 - 20~29.md	
+++ b/notes/剑指 Offer 题解 - 20~29.md	
@@ -14,7 +14,7 @@
 
 # 20. 表示数值的字符串
 
-[NowCoder](https://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -64,7 +64,7 @@ public boolean isNumeric(char[] str) {
 
 # 21. 调整数组顺序使奇数位于偶数前面
 
-[NowCoder](https://www.nowcoder.com/practice/beb5aa231adc45b2a5dcc5b62c93f593?tpId=13&tqId=11166&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/beb5aa231adc45b2a5dcc5b62c93f593?tpId=13&tqId=11166&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -125,7 +125,7 @@ private void swap(int[] nums, int i, int j) {
 
 # 22. 链表中倒数第 K 个结点
 
-[NowCoder](https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -153,7 +153,7 @@ public ListNode FindKthToTail(ListNode head, int k) {
 
 # 23. 链表中环的入口结点
 
-[NowCoder](https://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -187,7 +187,7 @@ public ListNode EntryNodeOfLoop(ListNode pHead) {
 
 # 24. 反转链表
 
-[NowCoder](https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -224,7 +224,7 @@ public ListNode ReverseList(ListNode head) {
 
 # 25. 合并两个排序的链表
 
-[NowCoder](https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -276,7 +276,7 @@ public ListNode Merge(ListNode list1, ListNode list2) {
 
 # 26. 树的子结构
 
-[NowCoder](https://www.nowcoder.com/practice/6e196c44c7004d15b1610b9afca8bd88?tpId=13&tqId=11170&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6e196c44c7004d15b1610b9afca8bd88?tpId=13&tqId=11170&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -304,7 +304,7 @@ private boolean isSubtreeWithRoot(TreeNode root1, TreeNode root2) {
 
 # 27. 二叉树的镜像
 
-[NowCoder](https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -330,7 +330,7 @@ private void swap(TreeNode root) {
 
 # 28 对称的二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -358,7 +358,7 @@ boolean isSymmetrical(TreeNode t1, TreeNode t2) {
 
 # 29. 顺时针打印矩阵
 
-[NowCoder](https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/notes/剑指 Offer 题解 - 30~39.md b/notes/剑指 Offer 题解 - 30~39.md
index 979e3526..bcf357ca 100644
--- a/notes/剑指 Offer 题解 - 30~39.md	
+++ b/notes/剑指 Offer 题解 - 30~39.md	
@@ -16,7 +16,7 @@
 
 # 30. 包含 min 函数的栈
 
-[NowCoder](https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -49,7 +49,7 @@ public int min() {
 
 # 31. 栈的压入、弹出序列
 
-[NowCoder](https://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106?tpId=13&tqId=11174&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106?tpId=13&tqId=11174&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -79,7 +79,7 @@ public boolean IsPopOrder(int[] pushSequence, int[] popSequence) {
 
 # 32.1 从上往下打印二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -117,7 +117,7 @@ public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
 
 # 32.2 把二叉树打印成多行
 
-[NowCoder](https://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&tqId=11213&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&tqId=11213&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -150,7 +150,7 @@ ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
 
 # 32.3 按之字形顺序打印二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -187,7 +187,7 @@ public ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
 
 # 33. 二叉搜索树的后序遍历序列
 
-[NowCoder](https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -222,7 +222,7 @@ private boolean verify(int[] sequence, int first, int last) {
 
 # 34. 二叉树中和为某一值的路径
 
-[NowCoder](https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -259,7 +259,7 @@ private void backtracking(TreeNode node, int target, ArrayList<Integer> path) {
 
 # 35. 复杂链表的复制
 
-[NowCoder](https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -327,7 +327,7 @@ public RandomListNode Clone(RandomListNode pHead) {
 
 # 36. 二叉搜索树与双向链表
 
-[NowCoder](https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -362,7 +362,7 @@ private void inOrder(TreeNode node) {
 
 # 37. 序列化二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -402,7 +402,7 @@ private TreeNode Deserialize() {
 
 # 38. 字符串的排列
 
-[NowCoder](https://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7?tpId=13&tqId=11180&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7?tpId=13&tqId=11180&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -443,7 +443,7 @@ private void backtracking(char[] chars, boolean[] hasUsed, StringBuilder s) {
 
 # 39. 数组中出现次数超过一半的数字
 
-[NowCoder](https://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163?tpId=13&tqId=11181&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163?tpId=13&tqId=11181&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
diff --git a/notes/剑指 Offer 题解 - 3~9.md b/notes/剑指 Offer 题解 - 3~9.md
index 305c388b..e07962d1 100644
--- a/notes/剑指 Offer 题解 - 3~9.md	
+++ b/notes/剑指 Offer 题解 - 3~9.md	
@@ -11,7 +11,7 @@
 
 # 3. 数组中重复的数字
 
-[NowCoder](https://www.nowcoder.com/practice/623a5ac0ea5b4e5f95552655361ae0a8?tpId=13&tqId=11203&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/623a5ac0ea5b4e5f95552655361ae0a8?tpId=13&tqId=11203&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -61,7 +61,7 @@ private void swap(int[] nums, int i, int j) {
 
 # 4. 二维数组中的查找
 
-[NowCoder](https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e?tpId=13&tqId=11154&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e?tpId=13&tqId=11154&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -109,7 +109,7 @@ public boolean Find(int target, int[][] matrix) {
 
 # 5. 替换空格
 
-[NowCoder](https://www.nowcoder.com/practice/4060ac7e3e404ad1a894ef3e17650423?tpId=13&tqId=11155&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/4060ac7e3e404ad1a894ef3e17650423?tpId=13&tqId=11155&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -158,7 +158,7 @@ public String replaceSpace(StringBuffer str) {
 
 # 6. 从尾到头打印链表
 
-[NowCoder](https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035?tpId=13&tqId=11156&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035?tpId=13&tqId=11156&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -237,7 +237,7 @@ public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
 
 # 7. 重建二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -276,7 +276,7 @@ private TreeNode reConstructBinaryTree(int[] pre, int preL, int preR, int inL) {
 
 # 8. 二叉树的下一个结点
 
-[NowCoder](https://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -327,7 +327,7 @@ public TreeLinkNode GetNext(TreeLinkNode pNode) {
 
 # 9. 用两个栈实现队列
 
-[NowCoder](https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6?tpId=13&tqId=11158&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6?tpId=13&tqId=11158&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/notes/剑指 Offer 题解 - 40~49.md b/notes/剑指 Offer 题解 - 40~49.md
index 7dc925fd..61bbc96d 100644
--- a/notes/剑指 Offer 题解 - 40~49.md	
+++ b/notes/剑指 Offer 题解 - 40~49.md	
@@ -15,7 +15,7 @@
 
 # 40. 最小的 K 个数
 
-[NowCoder](https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf?tpId=13&tqId=11182&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf?tpId=13&tqId=11182&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -97,7 +97,7 @@ public ArrayList<Integer> GetLeastNumbers_Solution(int[] nums, int k) {
 
 # 41.1 数据流中的中位数
 
-[NowCoder](https://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -138,7 +138,7 @@ public Double GetMedian() {
 
 # 41.2 字符流中第一个不重复的字符
 
-[NowCoder](https://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -164,7 +164,7 @@ public char FirstAppearingOnce() {
 
 # 42. 连续子数组的最大和
 
-[NowCoder](https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -188,7 +188,7 @@ public int FindGreatestSumOfSubArray(int[] nums) {
 
 # 43. 从 1 到 n 整数中 1 出现的次数
 
-[NowCoder](https://www.nowcoder.com/practice/bd7f978302044eee894445e244c7eee6?tpId=13&tqId=11184&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/bd7f978302044eee894445e244c7eee6?tpId=13&tqId=11184&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -262,7 +262,7 @@ private int getDigitAtIndex(int index, int place) {
 
 # 45. 把数组排成最小的数
 
-[NowCoder](https://www.nowcoder.com/practice/8fecd3f8ba334add803bf2a06af1b993?tpId=13&tqId=11185&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8fecd3f8ba334add803bf2a06af1b993?tpId=13&tqId=11185&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -388,7 +388,7 @@ public int longestSubStringWithoutDuplication(String str) {
 
 # 49. 丑数
 
-[NowCoder](https://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/notes/剑指 Offer 题解 - 50~59.md b/notes/剑指 Offer 题解 - 50~59.md
index 5f5acc53..fd065384 100644
--- a/notes/剑指 Offer 题解 - 50~59.md	
+++ b/notes/剑指 Offer 题解 - 50~59.md	
@@ -17,7 +17,7 @@
 
 # 50. 第一个只出现一次的字符位置
 
-[NowCoder](https://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -67,7 +67,7 @@ public int FirstNotRepeatingChar2(String str) {
 
 # 51. 数组中的逆序对
 
-[NowCoder](https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -116,7 +116,7 @@ private void merge(int[] nums, int l, int m, int h) {
 
 # 52. 两个链表的第一个公共结点
 
-[NowCoder](https://www.nowcoder.com/practice/6ab1d9a29e88450685099d45c9e31e46?tpId=13&tqId=11189&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/6ab1d9a29e88450685099d45c9e31e46?tpId=13&tqId=11189&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -141,7 +141,7 @@ public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
 
 # 53. 数字在排序数组中出现的次数
 
-[NowCoder](https://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2?tpId=13&tqId=11190&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2?tpId=13&tqId=11190&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -178,7 +178,7 @@ private int binarySearch(int[] nums, int K) {
 
 # 54. 二叉查找树的第 K 个结点
 
-[NowCoder](https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 解题思路
 
@@ -206,7 +206,7 @@ private void inOrder(TreeNode root, int k) {
 
 # 55.1 二叉树的深度
 
-[NowCoder](https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -224,7 +224,7 @@ public int TreeDepth(TreeNode root) {
 
 # 55.2 平衡二叉树
 
-[NowCoder](https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -255,7 +255,7 @@ private int height(TreeNode root) {
 
 # 56. 数组中只出现一次的数字
 
-[NowCoder](https://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -284,7 +284,7 @@ public void FindNumsAppearOnce(int[] nums, int num1[], int num2[]) {
 
 # 57.1 和为 S 的两个数字
 
-[NowCoder](https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -316,7 +316,7 @@ public ArrayList<Integer> FindNumbersWithSum(int[] array, int sum) {
 
 # 57.2 和为 S 的连续正数序列
 
-[NowCoder](https://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -360,7 +360,7 @@ public ArrayList<ArrayList<Integer>> FindContinuousSequence(int sum) {
 
 # 58.1 翻转单词顺序列
 
-[NowCoder](https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -408,7 +408,7 @@ private void swap(char[] c, int i, int j) {
 
 # 58.2 左旋转字符串
 
-[NowCoder](https://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -450,7 +450,7 @@ private void swap(char[] chars, int i, int j) {
 
 # 59. 滑动窗口的最大值
 
-[NowCoder](https://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
diff --git a/notes/剑指 Offer 题解 - 60~68.md b/notes/剑指 Offer 题解 - 60~68.md
index 51d2b54c..e151d567 100644
--- a/notes/剑指 Offer 题解 - 60~68.md	
+++ b/notes/剑指 Offer 题解 - 60~68.md	
@@ -86,7 +86,7 @@ public List<Map.Entry<Integer, Double>> dicesSum(int n) {
 
 # 61. 扑克牌顺子
 
-[NowCoder](https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -124,7 +124,7 @@ public boolean isContinuous(int[] nums) {
 
 # 62. 圆圈中最后剩下的数
 
-[NowCoder](https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -174,7 +174,7 @@ public int maxProfit(int[] prices) {
 
 # 64. 求 1+2+3+...+n
 
-[NowCoder](https://www.nowcoder.com/practice/7a0da8fc483247ff8800059e12d7caf1?tpId=13&tqId=11200&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/7a0da8fc483247ff8800059e12d7caf1?tpId=13&tqId=11200&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -198,7 +198,7 @@ public int Sum_Solution(int n) {
 
 # 65. 不用加减乘除做加法
 
-[NowCoder](https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -218,7 +218,7 @@ public int Add(int a, int b) {
 
 # 66. 构建乘积数组
 
-[NowCoder](https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 
@@ -243,7 +243,7 @@ public int[] multiply(int[] A) {
 
 # 67. 把字符串转换成整数
 
-[NowCoder](https://www.nowcoder.com/practice/1277c681251b4372bdef344468e4f26e?tpId=13&tqId=11202&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)
+[NowCoder](https://www.nowcoder.com/practice/1277c681251b4372bdef344468e4f26e?tpId=13&tqId=11202&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
 
 ## 题目描述
 

From 85f472266dd2ac64c84bd71ac3c595ecafd840ed Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Thu, 17 Oct 2019 02:23:07 +0800
Subject: [PATCH 9/9] auto commit

---
 docs/notes/Leetcode 题解 - 搜索.md | 7 +++----
 notes/Leetcode 题解 - 搜索.md      | 7 +++----
 2 files changed, 6 insertions(+), 8 deletions(-)

diff --git a/docs/notes/Leetcode 题解 - 搜索.md b/docs/notes/Leetcode 题解 - 搜索.md
index 2e0729e9..b884a189 100644
--- a/docs/notes/Leetcode 题解 - 搜索.md	
+++ b/docs/notes/Leetcode 题解 - 搜索.md	
@@ -503,13 +503,12 @@ Return:
 左边和上边是太平洋，右边和下边是大西洋，内部的数字代表海拔，海拔高的地方的水能够流到低的地方，求解水能够流到太平洋和大西洋的所有位置。
 
 ```java
-
 private int m, n;
 private int[][] matrix;
 private int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
 
-public List<int[]> pacificAtlantic(int[][] matrix) {
-    List<int[]> ret = new ArrayList<>();
+public List<List<Integer>> pacificAtlantic(int[][] matrix) {
+    List<List<Integer>> ret = new ArrayList<>();
     if (matrix == null || matrix.length == 0) {
         return ret;
     }
@@ -532,7 +531,7 @@ public List<int[]> pacificAtlantic(int[][] matrix) {
     for (int i = 0; i < m; i++) {
         for (int j = 0; j < n; j++) {
             if (canReachP[i][j] && canReachA[i][j]) {
-                ret.add(new int[]{i, j});
+                ret.add(Arrays.asList(i, j));
             }
         }
     }
diff --git a/notes/Leetcode 题解 - 搜索.md b/notes/Leetcode 题解 - 搜索.md
index 38945d90..4ce16d89 100644
--- a/notes/Leetcode 题解 - 搜索.md	
+++ b/notes/Leetcode 题解 - 搜索.md	
@@ -503,13 +503,12 @@ Return:
 左边和上边是太平洋，右边和下边是大西洋，内部的数字代表海拔，海拔高的地方的水能够流到低的地方，求解水能够流到太平洋和大西洋的所有位置。
 
 ```java
-
 private int m, n;
 private int[][] matrix;
 private int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
 
-public List<int[]> pacificAtlantic(int[][] matrix) {
-    List<int[]> ret = new ArrayList<>();
+public List<List<Integer>> pacificAtlantic(int[][] matrix) {
+    List<List<Integer>> ret = new ArrayList<>();
     if (matrix == null || matrix.length == 0) {
         return ret;
     }
@@ -532,7 +531,7 @@ public List<int[]> pacificAtlantic(int[][] matrix) {
     for (int i = 0; i < m; i++) {
         for (int j = 0; j < n; j++) {
             if (canReachP[i][j] && canReachA[i][j]) {
-                ret.add(new int[]{i, j});
+                ret.add(Arrays.asList(i, j));
             }
         }
     }