From c7e8bbbb06a244562a93548a9cf06d1ba73d40da Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=9F=B3=E7=90=A6=E5=B3=B0?= Date: Sun, 16 Apr 2017 16:21:25 +0800 Subject: [PATCH 01/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=A0=91=E7=9A=84?= =?UTF-8?q?=E7=9B=B8=E5=85=B3=E7=AE=97=E6=B3=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- images/Thumbs.db | Bin 0 -> 11264 bytes .../byhieg/algorithmtutorial/BinaryTree.java | 188 ++++++++++++++++++ .../algorithmtutorialtest/BinaryTreeTest.java | 79 ++++++++ 3 files changed, 267 insertions(+) create mode 100644 images/Thumbs.db create mode 100644 src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java create mode 100644 src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java diff --git a/images/Thumbs.db b/images/Thumbs.db new file mode 100644 index 0000000000000000000000000000000000000000..65a9b7400285769b52ba274414de5da6a5a07121 GIT binary patch literal 11264 zcmeHt2T)W`*6$_foFxhfl9ikkB?ke?NEAtubCNIue^8JhARrkeNfvI z7;?^O=8d~=_x-=`)mDA`wqDhH_3gR$cjt89+u`)-K7CHtjE+z&CIFz>f7Aa*BXEoE>u>%2#&5zwEAqF_@zB6W zg8&UeG>Fh3MuP+mQZ&fWKu-aH0u4$usL-HB<8Sr+wYGmh|6d;gUBC@}c>`>K65xvd z^#lUYTKumQEr9d)HUD?p@DGZA%pV0o>c%ntY%hcXF+d!!1ndAw^d$n=0uq4mUwAt- zCjy89R%l55gBk&V7r?~$^BDib5C8N68_l<|{VC&LWdGUr|HbD1x8naw`+qL`Z~njE z2+*Tv6BZi9Yyd$26aY-xok4ozGr!IGzv;ih2>c`cqkf^50CII@HDv$;<9`}<6bw)R zurM)y-)O={-#GXF>wh=DQN{oC1n*=HFZ6G14AR@ z7bey=ws!Wf9UQ&9eSH1=1Kx!H5fSE<)X!<@U-AnIi;BONlzy+NtpnFL zG(y@tI=i}idi(mvCnl$+XMW8>m*Fd`Yl!uY&8@?uU7Q+THy|4S|?K#YZfRvs1wAP3y)eTlvg{0-%uha{QrE5i_q zR>?NCpTlIx<&XHZn$MQ)CPi=Wy2u*bMt|HyFyzK?t?)dd&ib+9(07AZQhDbzOR8J8 zpQpGjxp~IxjXUClubWG2$g>?#eFdn|4+Xr{10B-X4PP;?`uegT~} z6|aeuoLx^;=nxU!{eg$=!g4cZ3Sv<3V@MRxR(^e6Zi*b2PnB#BQ{miWBGWN{*d_0H zpjo;3+GbN-T0^1aOJj+wE_=k9#MRSS{YKkHfo_psUO({;D>N9l)5HjN1ruq!qweVu zQGM+CxfBOeS=X}tn)=9>7=Vu5q8#288KYs}K%0L;)hvCaP z>cnE-w@SxVVVqKi$C#yi#@$-l`_jaB>I7m>UeX*mk7KIzL%#K5H%JWt4`|33t}k|+ zN>IQba`Gr3S1<>y!xAJlsGT(rG)kw90)FVD07A2zdCQsJM>*$or$pBqH$$(D$@ z<;~qIx?2oy6mWy1eUOhNza>Jxg@BNl#TPn#w^O%4;j<{f17yj;(q%t(qZCLInZ-ZW zl3X57WbVP3n#tO%%?)_mjw!9WRQRX2GaD(z=4mjNP%@-Tg+K7e0}e{3f2n`; zcboFtwp7VNz^(NY-d=_N*4k5wU>4^It@mV~DLfM2Bx?E{mDR}(}oIk zpWns0rV)}>Vcb-o@~RsPcZ7HjBdN>N5JcJh$m*4afPLp^8ug%6Fvoe!PXe|ix7c51 zK0VAHW>v)NlE_^p?kc{ijgwi2swJPId?H9jg;22A<=G=#H{ysCAFu{ZO}gaRZgJf) zb+VmH4}w9;YSM?HH0L1V=UM^igPrPUIop?1^d>;5&D5=pP zs0;fW!#YFd*X5F*COn0+;;Hjq+=4D<6PI#F(t+{Vuz3YyJqIZ9m^^+I=XeJ%*5rMm zo@Jw%j<(kgDNcwm!=wB-DmQ|tJgD)S7X0aDlXanopCx5&plM)0MyK?)K>OZXlE-W| zaN&oaaWRgK5Rw*+9Jr82a-9^vEE}39_XPQiYQhjam3dF9_l51fxGoO8bW>Q8 zoSR zdgG#p1)IJpjtFgbF@?KZtE9%)Nr@q~>5DMeGvw&VBAq;z7{XuH8g zo7DHEkop+@UD1q7ctWE8O9u+qyZ)iFythlj62kGFIs<~80~G2!eSHoH>xFx3Yio74 zp)r=`mg?VXhyEb%Va#QK&f*cT#C^Zxw3WV}G6)4nti_bkHqo!JgU*3tbN>!*I zbz9)swQqaeaDkFJRPLEITv5VM3~w$>ANBjO{hArxMfZD1cfbk?eoB9Kr+ zfA7~ykw*_E*l(jUfO<{S5<1j%`9{EZ%R9{FmH(8|{<~Fq8iSBge75*cWb@t}h4)&z zzg4@1p@0s!gr$VHA75A_tchJPt#@SE*mvR1DE~?n`$6mm1wJNay&`g*T_lN>6D!Uk zU8sGL$jm{4R@{OD=2)G<^D5=+^&F3t;7BGe(>JLT_WXsNSolUCRLo{^&oSn2y;YW`}<%25FM7NvtUX<;yB*?@}+XKz(jL1`jJk1L=2*X?wNX;IT_4DLkN z+(Zhld6*v$L$|U=c3Np{WAYh$u>{B3Tqk6zs=UB|FX-tPQ%Gw&SB-Z^P^OpMt!O;* znx#%lj!v|6SXL*Gmn26t#r19E^ZutIF<}e=OkOXHXHEkamK>1G4Gvt1qKWVkN{zK@ zd3Rgx3%n&9DfFI6J|~hpA^VU|;eDD?rF!r7e~&oKjt~ORt)!ey_1Y%L)4LMy%`f4^i;K5vL^e{ME zgu>Q0K@~dOxiY{Mzi-6tS8x%&vud`RElKf>u9A4 zU=H#4&c?C)2x*0Ct;$V93C$FgP8nT}DPPOgw#b4pfqkzTd zXwCQk)T`i6t?4P!rdiv85qB-S)xe76aTt+yTfby+6Ck1CW4vR@$vH?Yp(EL=cnuT8 z6rzF~n%>_|18IIv9FgJt9IIDwp<(s@>ftEU^rI6$U+J#q`f~|79)YaR$F{MbB3`{3 zv&N8kz=;{)whRZ0J|!u4v!yAYt{|s;kd>TvPJ20kE5%u6laxMD`BgtAd8Im|kT?41 z&E`fM-wg`D8iq2P$f!iZy3!{F8a^**;;iu&n!QYUpYqdIiu(fCa~SO?Q4k(L0R-aT z28STep`2Z21PpJ1BJ!7|SuOHc*^daLLpBRbQGoDu+fpW7TA9nc$M>d~KOqn5->qWI zc-sTm^u20yvN;QxFW)**bx-@H{~?Xjt^x9K%kQoLAzn0dZLhz#r>rEv4#?1YIy+)* zQT^QVMbB5`Ig>$xXn!bo&$%%-gx^^URt)QiEvspfpH!y#HgiO)NhU6R{Z4 z^U9RzxCZR+xwd63Z?IahS?D6sW_v;JyTCGYw=K^8BD6#sGeg&9QS&p;QRuN0o?P>Y z?8>htij4*4PiAvY68PWoi<%8%3u2Sp$rTIU{$R49xG<7gz7>CMbuhJ1m}k5J8L&`I zQn9CY1dh1732WS+;O!gv>F%UtX_bad7qkVq`J9}ffG}zurKi8p55Nj`0fBDeBO)iB zr!Y`UtAahPKE;GdZYZH0E&@@@s^JSUSZ+@(9tJ^O|Naz0#LW<0#G z@&CR!&@}4omZ90)KtA9R?BOD6;S}W&O8S&{Y#lppwv7BnM%8%*j1K(VG+!rB;O;uE zb34cvAlJV>ta{utxvrto(AwBE?Gr4p3aL#wRISby;v3Sz<~0%i`NEV}W#}l=dTn^w z;^~W1nD$^;^9_WS`T$}Lrfi0 zUo|h189Ke*g>}5~?EFy6|7L#N{vA^SIVW6s^?2l4H!?MMMB;t%)Ts;+b(TwBJ@|E@ z1R2Zpr|N~V5{6@7rIOSs8Lgq>0>mV!{RIkO)$4Gxw+?D9QH?Cho$tYRs68O*bS!wChL51IJsmiQ)Z4{Z3P8j8=r zl!ls(7(@2cL#t1QjF3Mk@4efR3)08R) zAEYzOLlH6#f;z7f#f|&Jh^X0a1|=^wJ<}sUr9!7Vm2T8%)+UvWG)y;ER3|>+5iaqp z1E-HI0-&0{(na~SN!9|BKhvz4*okYZB@J}uqu4O!5)5huq)lZ4xSM#P5fcIR#Kmml z4=A+H^{rGYMJCgilW7r`HdCj8zV&YGrss`1BWSl)@B@Dp@txi8O|%rS1;zJi?mN_Y zE1X{OAU!qGFxr#HLvIv_loy`Ocu3nmQxs zqhRK>y>Lg9YhU+Tu=dP1K~tbJVG|s`hChJGNO7Pw-7}GCRJN6_eU=21o*%InXi8OM z!`J534`VjA#v9K?b~mH_jx)615rTH^FQ%LZcgjbEw!R^fJ~7ozSfo2ZWZU<>gVQcjF&ju2hXKW!Is%IBN^gXdrr4pRy2tn(%g4nRKQECIoSap@N#@X!9YZ5I03 zXe)W;cV8(e4~w zf{bLVpGSKp`dVn;M6bFjSbRIZ_OGmS!QqPH(ymqY?ah04l_qm%t`riPYFnmUz4+p1 zz#Z_K#`}~fqz^yhZ-;@THxm(t4>JRj6FQy1tz4?JwZT|w$$tnZFt3&J2!~#OBOFwo z=;f}$iqjHVt~-Q@ve>_qm5%Oal{mLv#W5Y~8TJaVVbwdWTt|}6VFxxT%D%9rk(Vj#W&4DbwQB zu;iMt89NhYTY+kiq;t<;+Qx{BSlcuDN}KT;dmzE9b7Gv?brY-$t2-ky% znU1N`V|#lPfN#^rz1RHc$lC2jO?x2j^X)l(UrGMKr|)9r652)J9O8Hm6O&B@&Bt18 z20Y;h-ArdYd=W`-r9?H?oZ0LLFtJW?xbn-dMNhK^H4e&d6i<3jE8l6)qyz@j8BDZ+ z1vwg9Q>M!InCRTApQ-eBVkAcYNR%uZH?8XQj7?sxJ+&KZZGhq=cV$7f1AXi{pLc)N zAMjvG#Ev=|#E_CPPLxu9)MbubXxT(}b*~TwfCNAnr=ETg(n7eVqo&qU)Lv~`u4$lT zArGZo8uj-|{{=-WT*QipD=sdH#t#$#H4@SCZjql~&z#d(-MTMPJ%XM2vH5l^^a^3k z^LW!6S*|3dHZM~+p?yKTEmvO!+AyDN+h40f0WA5~zURn@c?~4e1ntvpt?f0_(JT=O zhI?-@nAzPDxsq^THQdY&RtyJ{smCq;_-F#_AvPg_mujr1AjfgCy5|djWrF8F#GLG! zSPtDT9*|VsuAhT`NRRApFJ9642wh*I?RHPew8dRIIwNwkUvrzW#O%IK;13S+s>3=k zdZ<^XkpOr2c@HMYdg1Fk$QD8Bbxz>qD>259J>iEY5YW4j*-|C({K9VV88`t3tLXgj zaIRcyhg4W{{picy)({G?WDh9x>4%+K9uR>84q5VOuK7rWe<8+b{R?m(i|piPc8pBP6$*H& zzh7rt7pL~3tND2c=P|=8JKnM|f4ppw38@~Mb>1?*|Ibz9&?TQ3WXV4Y$m z&u=$R#ws~paLhQH8&e&1&b@pn#n>RJymU^#9r~>PBI?Wh@ZE6J+H^g3#WLpRcYzY~ zMB&FQH}>J_i!g0uaNA8P3P|Km_PZGdMQhf0M*C*nF=55(pM`#;`hb=W?8yGr$AP?tDo?>c6oKCKQH3RCakARvsvL{H@S zUZg?Hp_YK&nxiiCY-Z2RWidgW*)8t_+~w82>V$1e&6w+HMkFMT^}7O(vi{55#%_OR zr<8Cw+57Y>$)byZQUxs8e!FYa$23%)OxQ?~2&`(c%~)G1)sZxs&#Sx1pS*jX1eZMS zU_CEF+u9MN*a$KImkM5wq^7C8)9t-a2#CaO&|uc%v$gV*>(rV+r>Nb55!d0pyKYHr zdl(tm3FpeerE^<%#cO&#q`g31a`O{r|A7^{J6_r2#H8!SIAG1-XSWisx5HaEu3|4r z6*R#5S%WuBS-oD8S?=nz$C5-^Cs|E2-yc>h7FVVSF<*2&g9r-ien+PDLxbc-ofX>` zJGLnY_m1voyOa-S&?m%rHX97db%5^>n)g{31t%ctjX9Hxl97sLf__+|Mj}Nwj~c&6 zZt*mGRhbtY4YAoLx*xuae{FF0f-uCY2e;mvge90l2>a@Euac`aZvJkA8or?cTLb@~ zXJ?|r|6s&hH{bP=Mgi~k zd}Lrt&dznrkB_G5?}cqG!x0h*Z4r!Y`^-J+?d}$!s3G0-iQp@VtANZT|3oG7q(eUK z!EsKVs${nmzw2n+xz#fo_boaTXQ*;nFr0H{=kXM$&b?+2K|At6KsOxmN`cMn)G;fB z8Tu8>dhmWj^UQ(LSi_>fTZ&4CiHeL^H~_s3Ye%~Bb55{*(406KdOW9m3@Gyc}=Lyc=U zRU28-UQ2ILQvCMuP0?k_5P0{zO(=cT(YbUcw)IJMSSid;BsA$QsDgb#b*NS`q9%qw z*@@faU?{uZ)kTQk!pS>lm%{m|zswm*O24$ixfEkVTGtJ`!9J)c$~*hTFLvKmw$Ij3 zqmI!;^^a#y=5NO?Sez1Rc*U;!)MQ$yy%+OWrvg&OH&W3@F4!jp&6htC6dj*81TV!9 z+vjxZ3#+=i3aGuu_sgW)3Nc)#-$Z)opWG5MYM2t;&rKvUr4Rb*N8P{TI)}6Jwx#O@ zB(^epVF4iX)(Xy>&e`*cR=gC z-ov88!VU7s0O|qPn4df+Kik~I-PhsuOsVvPP3h`qoydhY6p)Sf za^dL6i4|s)$_hzz=|us2BxSv_ER#BxQ9U9(>gvK(;yLFzm*@|_7uD%ldZ1?i8~j7# I|E`Gt1ISSgcmMzZ literal 0 HcmV?d00001 diff --git a/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java b/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java new file mode 100644 index 0000000..0fef3ec --- /dev/null +++ b/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java @@ -0,0 +1,188 @@ +package cn.byhieg.algorithmtutorial; + +import java.util.LinkedList; +import java.util.Queue; +import java.util.Stack; + +/** + * Created by byhieg on 17/4/15. + * Mail to byhieg@gmail.com + */ +public class BinaryTree { + + /** + * 递归的形式实现先续遍历 + * 根-左-右 + * + * @param root + */ + public static void preOrder1(Node root) { + if (root != null) { + System.out.print(root.data + " "); + preOrder1(root.left); + preOrder1(root.right); + } + } + + /** + * 非递归的形式实现先续遍历 + * 根-左-右 + * + * @param root + */ + public static void preOrder2(Node root) { + if (root != null) { + Stack stack = new Stack<>(); + stack.push(root); + while (!stack.isEmpty()) { + Node cur = stack.pop(); + System.out.print(cur.data + " "); + if (cur.right != null) { + stack.push(cur.right); + } + if (cur.left != null) { + stack.push(cur.left); + } + } + } + } + + /** + * 递归实现中序遍历 + * 左-根-右 + * + * @param root + */ + public static void inOrder1(Node root) { + if (root != null) { + inOrder1(root.left); + System.out.print(root.data + " "); + inOrder1(root.right); + } + } + + /** + * 非递归实现中序遍历 + * 左-根-右 + * + * @param root + */ + public static void inOrder2(Node root) { + if (root != null) { + Stack stack = new Stack<>(); + Node cur = root; + while (!stack.isEmpty() || cur != null) { + if (cur == null) { + Node node = stack.pop(); + System.out.print(node.data + " "); + cur = node.right; + } else { + stack.push(cur); + cur = cur.left; + } + + } + } + } + + /** + * 递归实现树的后续遍历 + * 左-右-根 + * + * @param root + */ + public static void postOrder1(Node root) { + if (root != null) { + postOrder1(root.left); + postOrder1(root.right); + System.out.print(root.data + " "); + } + } + + /** + * 非递归试树的后续遍历 + * 左-右-根 + * + * @param root + */ + public static void postOrder2(Node root) { + if (root != null) { + Stack tmpStack = new Stack<>(); + Stack resStack = new Stack<>(); + tmpStack.push(root); + while (!tmpStack.isEmpty()) { + Node cur = tmpStack.pop(); + resStack.push(cur); + if (cur.left != null) { + tmpStack.push(cur.left); + } + if (cur.right != null) { + tmpStack.push(cur.right); + } + } + + while (!resStack.isEmpty()) { + Node cur = resStack.pop(); + System.out.print(cur.data + " "); + } + } + } + + /** + * 层次遍历 + * + * @param root + */ + public static void levelOrder(Node root) { + if (root != null) { + Queue queue = new LinkedList<>(); + queue.offer(root); + while (!queue.isEmpty()) { + Node cur = queue.poll(); + System.out.print(cur.data + " "); + if (cur.left != null) { + queue.offer(cur.left); + } + if (cur.right != null) { + queue.offer(cur.right); + } + } + } + } + + /** + * 统计树的节点数 + * + * @param root + */ + public static int getNodes(Node root) { + if (root == null) { + return 0; + } + return getNodes(root.left) + getNodes(root.right) + 1; + } + + public static int getLeafs(Node root) { + if (root == null) { + return 0; + } + if (root.right == null && root.left == null) { + return 1; + } + return getLeafs(root.left) + getLeafs(root.right); + + } + + public static class Node { + public int data; + public Node left; + public Node right; + + + public Node(int data) { + this.data = data; + left = null; + right = null; + } + } +} diff --git a/src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java b/src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java new file mode 100644 index 0000000..8a3cf98 --- /dev/null +++ b/src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java @@ -0,0 +1,79 @@ +package cn.byhieg.algorithmtutorialtest; + +import cn.byhieg.algorithmtutorial.BinaryTree; +import cn.byhieg.iotutorial.bytestreamio.BufferdInputStreamExample; +import junit.framework.TestCase; + +/** + * Created by byhieg on 17/4/15. + * Mail to byhieg@gmail.com + */ +public class BinaryTreeTest extends TestCase { + + + BinaryTree.Node root = new BinaryTree.Node(1); + public void setUp() throws Exception { + super.setUp(); + BinaryTree.Node[] nodes = new BinaryTree.Node[10]; + nodes[0] = new BinaryTree.Node(2); + root.left = nodes[0]; + for (int i = 1 ; i < 10;i++) { + nodes[i] = new BinaryTree.Node(2 + i); + if (i % 2 == 0){ + nodes[i - 1].left = nodes[i]; + }else{ + nodes[i - 1].right = nodes[i]; + } + } + + } + + public void tearDown() throws Exception { + System.out.println(); + } + + public void testPreOrder1() throws Exception { + System.out.println("递归的先续遍历"); + BinaryTree.preOrder1(root); + } + + public void testPreOrder2() throws Exception { + System.out.println("非递归的先续遍历"); + BinaryTree.preOrder2(root); + } + + + public void testInOrder1() throws Exception { + System.out.println("递归的中序遍历"); + BinaryTree.inOrder1(root); + } + + public void testInOrder2() throws Exception { + System.out.println("非递归的中序遍历"); + BinaryTree.inOrder2(root); + } + + public void testPostOrder1() throws Exception { + System.out.println("递归的后续遍历"); + BinaryTree.postOrder1(root); + } + + public void testPostOrder2() throws Exception { + System.out.println("非递归的后续遍历"); + BinaryTree.postOrder2(root); + } + + public void testLevelOrder() throws Exception { + System.out.println("层次遍历"); + BinaryTree.levelOrder(root); + } + + public void testGetNodes() throws Exception { + System.out.println("节点数" + BinaryTree.getNodes(root)); + } + + public void testGetLeafs() throws Exception { + System.out.println("叶子数" + BinaryTree.getLeafs(root)); + } + +} \ No newline at end of file From 02de7695d1546d60d2d15bbe2bc6a9cd9a02f154 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=9F=B3=E7=90=A6=E5=B3=B0?= Date: Sun, 16 Apr 2017 16:58:48 +0800 Subject: [PATCH 02/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=A0=91=E7=9A=84?= =?UTF-8?q?=E4=B8=80=E4=BA=9B=E7=AE=97=E6=B3=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../byhieg/algorithmtutorial/BinaryTree.java | 69 +++++++++++++++++++ .../algorithmtutorialtest/BinaryTreeTest.java | 17 +++-- 2 files changed, 82 insertions(+), 4 deletions(-) diff --git a/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java b/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java index 0fef3ec..62f4343 100644 --- a/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java +++ b/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java @@ -162,6 +162,11 @@ public static int getNodes(Node root) { return getNodes(root.left) + getNodes(root.right) + 1; } + /** + * 得到树的叶子节点的数目 + * @param root + * @return + */ public static int getLeafs(Node root) { if (root == null) { return 0; @@ -173,6 +178,70 @@ public static int getLeafs(Node root) { } + + /** + * 计算树的深度 + * @param root + * @return + */ + public static int getHeight(Node root){ + if (root == null) { + return 0; + } + int leftHeight = getHeight(root.left) + 1; + int rightHeight = getHeight(root.right) + 1; + return leftHeight > rightHeight ? leftHeight : rightHeight; + } + + /** + * 计算第K层的节点数 + * @param root + * @param k + * @return + */ + public static int calcKNodes(Node root, int k) { + if (root == null || k < 0) { + return 0; + } + if (k == 0){ + return 1; + } + return calcKNodes(root.left, k - 1) + calcKNodes(root.right, k - 1); + + } + + /** + * 判断两个树的结构是否相同 + * @param root1 + * @param root2 + * @return + */ + public static boolean isCommon(Node root1, Node root2) { + if (root1 == null && root2 == null) { + return true; + } else if (root1 == null || root2 == null) { + return false; + }else{ + boolean isLeftCommon = isCommon(root1.left, root2.left); + boolean isRightCommon = isCommon(root1.right, root2.right); + return isLeftCommon && isRightCommon; + } + } + + /** + * 得到树的镜像，即对于每一个节点，交换他们的左右孩子节点。 + * @param root + */ + public static void mirror(Node root) { + if (root != null) { + Node tmp = root.left; + root.left = root.right; + root.right = tmp; + mirror(root.left); + mirror(root.right); + } + } + public static class Node { public int data; public Node left; diff --git a/src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java b/src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java index 8a3cf98..9c1cfa5 100644 --- a/src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java +++ b/src/test/java/cn/byhieg/algorithmtutorialtest/BinaryTreeTest.java @@ -1,7 +1,6 @@ package cn.byhieg.algorithmtutorialtest; import cn.byhieg.algorithmtutorial.BinaryTree; -import cn.byhieg.iotutorial.bytestreamio.BufferdInputStreamExample; import junit.framework.TestCase; /** @@ -10,7 +9,6 @@ */ public class BinaryTreeTest extends TestCase { - BinaryTree.Node root = new BinaryTree.Node(1); public void setUp() throws Exception { super.setUp(); @@ -69,11 +67,22 @@ public void testLevelOrder() throws Exception { } public void testGetNodes() throws Exception { - System.out.println("节点数" + BinaryTree.getNodes(root)); + System.out.print("节点数" + BinaryTree.getNodes(root)); } public void testGetLeafs() throws Exception { - System.out.println("叶子数" + BinaryTree.getLeafs(root)); + System.out.print("叶子数" + BinaryTree.getLeafs(root)); + } + + public void testGetHeight() throws Exception { + System.out.print("树的高度" + BinaryTree.getHeight(root)); } + public void testCalcKNodes() throws Exception { + System.out.print("第2层的节点数" + BinaryTree.calcKNodes(root,2)); + } + + public void testMirror() throws Exception { + BinaryTree.mirror(root); + } } \ No newline at end of file From 8632db251c488e2bc5aec460b80c7e0a03c656ac Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=9F=B3=E7=90=A6=E5=B3=B0?= Date: Tue, 2 May 2017 21:27:12 +0800 Subject: [PATCH 03/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E5=8D=95=E9=93=BE?= =?UTF-8?q?=E8=A1=A8=E7=9A=84=E7=9B=B8=E5=85=B3=E7=AE=97=E6=B3=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../byhieg/algorithmtutorial/BinaryTree.java | 28 ++++++ .../algorithmtutorial/SingleLinkList.java | 89 +++++++++++++++++++ .../SingleLinkListTest.java | 57 ++++++++++++ 3 files changed, 174 insertions(+) create mode 100644 src/main/java/cn/byhieg/algorithmtutorial/SingleLinkList.java create mode 100644 src/test/java/cn/byhieg/algorithmtutorialtest/SingleLinkListTest.java diff --git a/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java b/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java index 62f4343..1b026ed 100644 --- a/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java +++ b/src/main/java/cn/byhieg/algorithmtutorial/BinaryTree.java @@ -242,6 +242,32 @@ public static void mirror(Node root) { } } + /** + * 得到两个节点的最近公共祖先节点。 + * 递归左右子树，如果返回的值都不为空，则表示在左右子树各找到一个target，因为最近的祖先就是cur + * 如果有一个为空，则就不为空就是最近公共祖先。 + * @param root + * @param target1 + * @param target2 + * @return + */ + public static Node findLCA(Node root, Node target1, Node target2) { + if (root == null) + return null; + + if (root == target1 || root == target2) { + return root; + } + Node left = findLCA(root.left, target1, target2); + Node right = findLCA(root.right, target1, target2); + if (left != null && right != null) { + return root; + } + return left != null ? left:right; + } + + + public static class Node { public int data; public Node left; @@ -254,4 +280,6 @@ public Node(int data) { right = null; } } + + } diff --git a/src/main/java/cn/byhieg/algorithmtutorial/SingleLinkList.java b/src/main/java/cn/byhieg/algorithmtutorial/SingleLinkList.java new file mode 100644 index 0000000..28b29ae --- /dev/null +++ b/src/main/java/cn/byhieg/algorithmtutorial/SingleLinkList.java @@ -0,0 +1,89 @@ +package cn.byhieg.algorithmtutorial; + +/** + * Created by byhieg on 17/5/2. + * Mail to byhieg@gmail.com + */ +public class SingleLinkList { + + + public Node head; + + /** + * 在当前链表尾部插入一个节点 + * + * @param data + * @return + */ + public Node insertFromTail(int data) { + Node cur = getHead(); + Node node = new Node(data); + if (cur == null) { + head = node; + return head; + } else { + while (cur.next != null) { + cur = cur.next; + } + cur.next = node; + } + return cur; + } + + /** + * 在当前链表头部插入一个节点 + * + * @param data + * @return + */ + public Node insertFromHead(int data) { + Node node = new Node(data); + node.next = head; + head = node; + return head; + } + + + public Node reverseLinkList() { + if (head == null) { + return head; + } + Node reverseHead = null; + Node cur = head; + Node prev = null; + while (cur != null) { + Node next = cur.next; + if (next == null) { + reverseHead = cur; + } + cur.next = prev; + prev = cur; + cur = next; + } + return reverseHead; + } + + /** + * 打印链表 + */ + public void printLinkList(Node head) { + Node cur = head; + while (cur != null) { + System.out.print(cur.data + " "); + cur = cur.next; + } + } + + public Node getHead() { + return head; + } + + public static class Node { + public int data; + public Node next; + + public Node(int data) { + this.data = data; + } + } +} diff --git a/src/test/java/cn/byhieg/algorithmtutorialtest/SingleLinkListTest.java b/src/test/java/cn/byhieg/algorithmtutorialtest/SingleLinkListTest.java new file mode 100644 index 0000000..862359a --- /dev/null +++ b/src/test/java/cn/byhieg/algorithmtutorialtest/SingleLinkListTest.java @@ -0,0 +1,57 @@ +package cn.byhieg.algorithmtutorialtest; + +import cn.byhieg.algorithmtutorial.SingleLinkList; +import junit.framework.TestCase; + +/** + * Created by byhieg on 17/5/2. + * Mail to byhieg@gmail.com + */ +public class SingleLinkListTest extends TestCase { + + + SingleLinkList linkList; + + public void setUp() throws Exception { + super.setUp(); + linkList = new SingleLinkList(); + } + + public void tearDown() throws Exception { +// linkList.printLinkList(linkList.head); +// System.out.println(); + } + + + public void testInsertFromTail() throws Exception { +// linkList.insertFromTail(1); +// linkList.insertFromTail(2); +// linkList.insertFromTail(3); +// linkList.insertFromTail(4); +// linkList.insertFromTail(5); +// linkList.insertFromTail(6); +// System.out.println("尾插入"); + } + + public void testInsertFromHead() throws Exception { +// linkList.insertFromHead(1); +// linkList.insertFromHead(2); +// linkList.insertFromHead(3); +// linkList.insertFromHead(4); +// linkList.insertFromHead(5); +// linkList.insertFromHead(6); +// System.out.println("头插入"); + } + public void testReverseLinkList() throws Exception { + linkList.insertFromHead(1); + linkList.insertFromHead(2); + linkList.insertFromHead(3); + linkList.insertFromHead(4); + linkList.insertFromHead(5); + linkList.insertFromHead(6); + linkList.printLinkList(linkList.reverseLinkList()); + } + public void testGetHead() throws Exception { + } + +} \ No newline at end of file From d200fb2c02e3ad351125a6a893dcb841e585fae6 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=9F=B3=E7=90=A6=E5=B3=B0?= Date: Wed, 3 May 2017 17:23:12 +0800 Subject: [PATCH 04/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E9=98=BB=E5=A1=9E?= =?UTF-8?q?=E9=98=9F=E5=88=97?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../concurrent/blocking/ArrayBlock.java | 21 ++++++++++++ .../concurrent/blocking/Costumer.java | 31 +++++++++++++++++ .../concurrent/blocking/Producer.java | 30 ++++++++++++++++ .../blockingtest/ArrayBlockTest.java | 34 +++++++++++++++++++ 4 files changed, 116 insertions(+) create mode 100644 src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java create mode 100644 src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java create mode 100644 src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java create mode 100644 src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java new file mode 100644 index 0000000..b31b674 --- /dev/null +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java @@ -0,0 +1,21 @@ +package cn.byhieg.threadtutorial.concurrent.blocking; + +import java.util.concurrent.ArrayBlockingQueue; +import java.util.concurrent.BlockingQueue; + +/** + * Created by byhieg on 17/5/3. + * Mail to byhieg@gmail.com + */ +public class ArrayBlock { + + private BlockingQueue blockingQueue; + + public ArrayBlock(){ + blockingQueue = new ArrayBlockingQueue(1024); + } + + public BlockingQueue getBlockingQueue() { + return blockingQueue; + } +} diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java new file mode 100644 index 0000000..d69c647 --- /dev/null +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java @@ -0,0 +1,31 @@ +package cn.byhieg.threadtutorial.concurrent.blocking; + +import java.util.concurrent.BlockingQueue; + +/** + * Created by byhieg on 17/5/3. + * Mail to byhieg@gmail.com + */ +public class Costumer extends Thread{ + + private BlockingQueue blockingQueue; + + public Costumer(ArrayBlock arrayBlock) { + blockingQueue = arrayBlock.getBlockingQueue(); + this.setName("Costumer"); + } + + @Override + public void run() { + super.run(); + while (true) { + try { + Thread.sleep(2000); + String str = blockingQueue.take(); + System.out.println(getName() + " 取出数据 " + str); + } catch (InterruptedException e) { + e.printStackTrace(); + } + } + } +} diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java new file mode 100644 index 0000000..5298546 --- /dev/null +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java @@ -0,0 +1,30 @@ +package cn.byhieg.threadtutorial.concurrent.blocking; + +import java.util.concurrent.BlockingQueue; + +/** + * Created by byhieg on 17/5/3. + * Mail to byhieg@gmail.com + */ +public class Producer extends Thread { + + private BlockingQueue blockingQueue; + @Override + public void run() { + super.run(); + for (int i = 0 ; i < 5;i++) { + try { + System.out.println(getName() + " 生产数据"); + blockingQueue.put(i + ""); + Thread.sleep(1000); + } catch (InterruptedException e) { + e.printStackTrace(); + } + } + } + + public Producer(ArrayBlock arrayBlock){ + this.setName("Producer"); + blockingQueue = arrayBlock.getBlockingQueue(); + } +} diff --git a/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java new file mode 100644 index 0000000..8c695b2 --- /dev/null +++ b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java @@ -0,0 +1,34 @@ +package cn.byhieg.threadtutorialtest.concurrenttest.blockingtest; + +import cn.byhieg.threadtutorial.concurrent.blocking.ArrayBlock; +import cn.byhieg.threadtutorial.concurrent.blocking.Costumer; +import cn.byhieg.threadtutorial.concurrent.blocking.Producer; +import junit.framework.TestCase; + +import javax.swing.*; + +/** + * Created by byhieg on 17/5/3. + * Mail to byhieg@gmail.com + */ +public class ArrayBlockTest extends TestCase { + ArrayBlock block; + public void setUp() throws Exception { + super.setUp(); + block = new ArrayBlock(); + } + + public void tearDown() throws Exception { + } + + + public void testBlocking() throws Exception { + Producer producer = new Producer(block); + Costumer costumer = new Costumer(block); + producer.start(); + costumer.start(); + producer.join(); + costumer.join(); + + } +} \ No newline at end of file From 849f9f0f254cad65730340fbf06a319c12aa79e8 Mon Sep 17 00:00:00 2001 From: byhieg Date: Fri, 5 May 2017 15:45:47 +0800 Subject: [PATCH 05/17] nothing --- .../java/cn/byhieg/niotutorial/NioTest.java | 44 +++++++++++++------ 1 file changed, 31 insertions(+), 13 deletions(-) diff --git a/src/main/java/cn/byhieg/niotutorial/NioTest.java b/src/main/java/cn/byhieg/niotutorial/NioTest.java index 7ee0a08..259ca37 100644 --- a/src/main/java/cn/byhieg/niotutorial/NioTest.java +++ b/src/main/java/cn/byhieg/niotutorial/NioTest.java @@ -6,6 +6,8 @@ import java.io.RandomAccessFile; import java.nio.ByteBuffer; import java.nio.channels.FileChannel; +import java.util.ArrayList; +import java.util.List; /** * Created by shiqifeng on 2017/4/10. @@ -14,22 +16,38 @@ public class NioTest { public static void main(String[] args) throws IOException { - String s = File.separator; - RandomAccessFile aFile = new RandomAccessFile("D:" + s + "read_file.txt","rw"); - FileChannel inChannel = aFile.getChannel(); - - ByteBuffer buf = ByteBuffer.allocate(48); - int bytesRead = inChannel.read(buf); - while (bytesRead != -1) { - buf.flip(); - while (buf.hasRemaining()) { - System.out.print((char) buf.get()); + for (int i = 2; i <= 100; i++) { + if(i == 2 || i == 5 || i == 7 || i == 3){ + System.out.print(i + " "); + continue; + } + if (i % 2 == 0 || i % 3 == 0 || i % 5 == 0 || i % 7 == 0) { + continue; } - buf.clear(); - bytesRead = inChannel.read(buf); + System.out.print(i + " "); + } + System.out.println(); + for (int i = 2 ; i <= 100;i++){ + if (isPrime(i)){ + System.out.print(i + " "); + } } + } + + + public static boolean isPrime(int n){ + if(n < 2){ + return false; + } + for (int i = 2; i <= Math.sqrt(n);i++){ + if (n % i == 0){ + return false; + } + } + return true; - aFile.close(); } + + } From 48d25d786f950fb80cd1690abcff7cbd789c9fbc Mon Sep 17 00:00:00 2001 From: byhieg Date: Fri, 5 May 2017 18:21:02 +0800 Subject: [PATCH 06/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E5=8E=9F=E5=AD=90?= =?UTF-8?q?=E7=B1=BB?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../concurrent/atom/AtomFactory.java | 36 ++++++++++ .../concurrent/atom/MyObject.java | 12 ++++ .../atomtest/AtomFactoryTest.java | 69 +++++++++++++++++++ 3 files changed, 117 insertions(+) create mode 100644 src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java create mode 100644 src/main/java/cn/byhieg/threadtutorial/concurrent/atom/MyObject.java create mode 100644 src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java new file mode 100644 index 0000000..36daa15 --- /dev/null +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java @@ -0,0 +1,36 @@ +package cn.byhieg.threadtutorial.concurrent.atom; + +import java.util.concurrent.atomic.AtomicInteger; +import java.util.concurrent.atomic.AtomicIntegerArray; +import java.util.concurrent.atomic.AtomicLong; +import java.util.concurrent.atomic.AtomicReference; + +/** + * Created by shiqifeng on 2017/5/5. + * Mail byhieg@gmail.com + */ +public class AtomFactory { + + private static final AtomFactory atomFactory = new AtomFactory(); + + private AtomFactory(){ + + } + + public static AtomFactory getInstance(){ + return atomFactory; + } + + public AtomicInteger createAtomInt(int a){ + return new AtomicInteger(a); + } + + public AtomicIntegerArray createAtomArray(int[] a) { + return new AtomicIntegerArray(a); + } + + public AtomicReference createAtomReference(MyObject object){ + AtomicReference objectAtomicReference = new AtomicReference<>(); + return objectAtomicReference; + } +} diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/MyObject.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/MyObject.java new file mode 100644 index 0000000..69ebbb6 --- /dev/null +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/MyObject.java @@ -0,0 +1,12 @@ +package cn.byhieg.threadtutorial.concurrent.atom; + +/** + * Created by shiqifeng on 2017/5/5. + * Mail byhieg@gmail.com + */ +public class MyObject { + + public String name = "byhieg"; + public int age = 24; + public volatile int id = 1; +} diff --git a/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java new file mode 100644 index 0000000..67aad49 --- /dev/null +++ b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java @@ -0,0 +1,69 @@ +package cn.byhieg.threadtutorialtest.concurrenttest.atomtest; + +import cn.byhieg.threadtutorial.concurrent.atom.AtomFactory; + +import cn.byhieg.threadtutorial.concurrent.atom.MyObject; +import junit.framework.TestCase; + +import java.util.concurrent.atomic.AtomicInteger; +import java.util.concurrent.atomic.AtomicIntegerArray; +import java.util.concurrent.atomic.AtomicReference; + +/** + * Created by shiqifeng on 2017/5/5. + * Mail byhieg@gmail.com + */ +public class AtomFactoryTest extends TestCase { + AtomicInteger integer; + AtomicIntegerArray array; + AtomicReference reference; + + public void setUp() throws Exception { + super.setUp(); + integer = AtomFactory.getInstance().createAtomInt(1); + } + + public void testAtomInt() throws Exception { + new Thread(()->{ + for (int i = 0; i < 10; i++) { + integer.getAndIncrement(); + System.out.println(getName() + " " + integer.get()); + } + }).start(); + + new Thread(()->{ + for (int i = 0; i < 10; i++) { + integer.getAndIncrement(); + System.out.println(getName() + " " + integer.get()); + } + }).start(); + + Thread.sleep(1000); + } + + public void testAtomArray() throws Exception { + int [] value = new int[]{1,2,3,4}; + array = AtomFactory.getInstance().createAtomArray(value); + array.getAndSet(1,10); + System.out.println(array.get(1)); + System.out.println(value[1]); + } + + public void testAtomRef()throws Exception { + MyObject object = new MyObject(); + reference = AtomFactory.getInstance().createAtomReference(object); + reference.set(object); + MyObject newObject = new MyObject(); + newObject.name = "xiaoli"; + reference.compareAndSet(object, newObject); + System.out.println(reference.get().name); + + } + + + public void tearDown() throws Exception { + + } + + +} \ No newline at end of file From 4d5f713eb52b6fba5cb2228c32bf3edb732569e1 Mon Sep 17 00:00:00 2001 From: byhieg Date: Sun, 7 May 2017 10:28:38 +0800 Subject: [PATCH 07/17] =?UTF-8?q?=E5=A2=9E=E5=8A=A0=E5=8E=9F=E5=AD=90?= =?UTF-8?q?=E7=B1=BB=E6=9B=B4=E6=96=B0=E5=AD=97=E6=AE=B5=E7=9A=84=E6=96=B9?= =?UTF-8?q?=E6=B3=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../threadtutorial/concurrent/atom/AtomFactory.java | 12 ++++++------ .../concurrenttest/atomtest/AtomFactoryTest.java | 13 +++++++++++++ 2 files changed, 19 insertions(+), 6 deletions(-) diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java index 36daa15..f5da772 100644 --- a/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/atom/AtomFactory.java @@ -1,9 +1,6 @@ package cn.byhieg.threadtutorial.concurrent.atom; -import java.util.concurrent.atomic.AtomicInteger; -import java.util.concurrent.atomic.AtomicIntegerArray; -import java.util.concurrent.atomic.AtomicLong; -import java.util.concurrent.atomic.AtomicReference; +import java.util.concurrent.atomic.*; /** * Created by shiqifeng on 2017/5/5. @@ -30,7 +27,10 @@ public AtomicIntegerArray createAtomArray(int[] a) { } public AtomicReference createAtomReference(MyObject object){ - AtomicReference objectAtomicReference = new AtomicReference<>(); - return objectAtomicReference; + return new AtomicReference<>(); + } + + public AtomicIntegerFieldUpdater createAtomIntegerUpdate(String fieldName) { + return AtomicIntegerFieldUpdater.newUpdater(MyObject.class, fieldName); } } diff --git a/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java index 67aad49..e8b706a 100644 --- a/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java +++ b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/atomtest/AtomFactoryTest.java @@ -7,6 +7,7 @@ import java.util.concurrent.atomic.AtomicInteger; import java.util.concurrent.atomic.AtomicIntegerArray; +import java.util.concurrent.atomic.AtomicIntegerFieldUpdater; import java.util.concurrent.atomic.AtomicReference; /** @@ -17,6 +18,7 @@ public class AtomFactoryTest extends TestCase { AtomicInteger integer; AtomicIntegerArray array; AtomicReference reference; + AtomicIntegerFieldUpdater updater; public void setUp() throws Exception { super.setUp(); @@ -24,6 +26,7 @@ public void setUp() throws Exception { } public void testAtomInt() throws Exception { + System.out.println("int原子类"); new Thread(()->{ for (int i = 0; i < 10; i++) { integer.getAndIncrement(); @@ -42,6 +45,7 @@ public void testAtomInt() throws Exception { } public void testAtomArray() throws Exception { + System.out.println("原子类数组"); int [] value = new int[]{1,2,3,4}; array = AtomFactory.getInstance().createAtomArray(value); array.getAndSet(1,10); @@ -50,6 +54,7 @@ public void testAtomArray() throws Exception { } public void testAtomRef()throws Exception { + System.out.println("原子类"); MyObject object = new MyObject(); reference = AtomFactory.getInstance().createAtomReference(object); reference.set(object); @@ -57,7 +62,15 @@ public void testAtomRef()throws Exception { newObject.name = "xiaoli"; reference.compareAndSet(object, newObject); System.out.println(reference.get().name); + } + + public void testUpdater() throws Exception { + System.out.println("原子类更新字段"); + updater = AtomFactory.getInstance().createAtomIntegerUpdate("id"); + MyObject object = new MyObject(); + System.out.println(updater.getAndIncrement(object)); + System.out.println(updater.get(object)); } From dfdea96492994c84d4874c4a43dffad3e8be3fe0 Mon Sep 17 00:00:00 2001 From: byhieg Date: Sun, 7 May 2017 12:12:31 +0800 Subject: [PATCH 08/17] =?UTF-8?q?=E5=A2=9E=E5=8A=A0Builder=E8=AE=BE?= =?UTF-8?q?=E8=AE=A1=E6=A8=A1=E5=BC=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../designpatterntutorial/builder/Person.java | 73 +++++++++++++++++++ .../BuilderTest.java | 16 ++++ 2 files changed, 89 insertions(+) create mode 100644 src/main/java/cn/byhieg/designpatterntutorial/builder/Person.java create mode 100644 src/test/java/cn/byhieg/designpatterntutorialtest/BuilderTest.java diff --git a/src/main/java/cn/byhieg/designpatterntutorial/builder/Person.java b/src/main/java/cn/byhieg/designpatterntutorial/builder/Person.java new file mode 100644 index 0000000..91077fd --- /dev/null +++ b/src/main/java/cn/byhieg/designpatterntutorial/builder/Person.java @@ -0,0 +1,73 @@ +package cn.byhieg.designpatterntutorial.builder; + +/** + * Created by shiqifeng on 2017/5/7. + * Mail byhieg@gmail.com + */ +public class Person { + + private int age; + private String name; + private int height; + private int weight; + + public int getAge() { + return age; + } + + public String getName() { + return name; + } + + public int getHeight() { + return height; + } + + public int getWeight() { + return weight; + } + + public Person(Builder builder) { + age = builder.age; + name = builder.name; + height = builder.height; + weight = builder.weight; + } + + @Override + public String toString() { + return "age = " + age + " name = " + name + " height = " + height + " weight = " + weight; + } + + public static class Builder{ + + private int age; + private String name; + private int height; + private int weight; + + public Builder setAge(int age) { + this.age = age; + return this; + } + + public Builder setName(String name) { + this.name = name; + return this; + } + + public Builder setHeight(int height) { + this.height = height; + return this; + } + + public Builder setWeight(int weight) { + this.weight = weight; + return this; + } + + public Person build() { + return new Person(this); + } + } +} diff --git a/src/test/java/cn/byhieg/designpatterntutorialtest/BuilderTest.java b/src/test/java/cn/byhieg/designpatterntutorialtest/BuilderTest.java new file mode 100644 index 0000000..2a67a00 --- /dev/null +++ b/src/test/java/cn/byhieg/designpatterntutorialtest/BuilderTest.java @@ -0,0 +1,16 @@ +package cn.byhieg.designpatterntutorialtest; + +import cn.byhieg.designpatterntutorial.builder.Person; +import junit.framework.TestCase; + +/** + * Created by shiqifeng on 2017/5/7. + * Mail byhieg@gmail.com + */ +public class BuilderTest extends TestCase { + public void testBuild() throws Exception { + Person person = new Person.Builder().setAge(24).setHeight(178).setName("byhieg").setWeight(80).build(); + System.out.println(person.toString()); + } + +} \ No newline at end of file From 3c1aee624f2df428e7986d32e493b8eeefaa1dc4 Mon Sep 17 00:00:00 2001 From: byhieg Date: Sun, 7 May 2017 16:03:30 +0800 Subject: [PATCH 09/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0Alert=20Builder?= =?UTF-8?q?=E7=9A=84Builder=E6=A8=A1=E5=BC=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../builder/SimpleDialog.java | 78 ++++++++++++++++++ .../builder/SimpleDialogController.java | 81 +++++++++++++++++++ .../SimpleDialogTest.java | 18 +++++ 3 files changed, 177 insertions(+) create mode 100644 src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialog.java create mode 100644 src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialogController.java create mode 100644 src/test/java/cn/byhieg/designpatterntutorialtest/SimpleDialogTest.java diff --git a/src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialog.java b/src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialog.java new file mode 100644 index 0000000..0d90062 --- /dev/null +++ b/src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialog.java @@ -0,0 +1,78 @@ +package cn.byhieg.designpatterntutorial.builder; + +/** + * Created by shiqifeng on 2017/5/7. + * Mail byhieg@gmail.com + */ +public class SimpleDialog { + + + public SimpleDialogController controller; + + public SimpleDialog(){ + controller = new SimpleDialogController(); + } + + public void setIcon(String icon) { + controller.setIcon(icon); + } + + public void setTitle(String title) { + controller.setTitle(title); + } + + public void setMessage(String message) { + controller.setMessage(message); + } + + public void setPositiveButton(String positiveButton) { + controller.setPositiveButton(positiveButton); + } + + public void setNegativeButton(String negativeButton) { + controller.setNegativeButton(negativeButton); + } + + + public static class Builder{ + SimpleDialogController.DialogParams P; + + public Builder(){ + P = new SimpleDialogController.DialogParams(); + } + + public Builder setIcon(String icon){ + P.icon = icon; + return this; + } + + public Builder setTitle(String title) { + P.title = title; + return this; + } + + public Builder setMessage(String message) { + P.message = message; + return this; + } + + public Builder setPositiveButton(String positiveButton) { + P.positiveButton = positiveButton; + return this; + } + + public Builder setNegativeButton(String negativeButton) { + P.negativeButton = negativeButton; + return this; + } + + public SimpleDialog create(){ + SimpleDialog dialog = new SimpleDialog(); + P.apply(dialog.controller); + System.out.println(" ICON = " + P.icon + " MESSAGE = " + P.message + " positiveButton = " + P.positiveButton + " negativeButton" + P.negativeButton); + return dialog; + } + } + + +} diff --git a/src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialogController.java b/src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialogController.java new file mode 100644 index 0000000..4d41b74 --- /dev/null +++ b/src/main/java/cn/byhieg/designpatterntutorial/builder/SimpleDialogController.java @@ -0,0 +1,81 @@ +package cn.byhieg.designpatterntutorial.builder; + +/** + * Created by shiqifeng on 2017/5/7. + * Mail byhieg@gmail.com + */ +public class SimpleDialogController { + + private String icon; + private String title; + private String message; + private String positiveButton; + private String negativeButton; + + public void setIcon(String icon) { + this.icon = icon; + } + + public void setTitle(String title) { + this.title = title; + } + + public void setMessage(String message) { + this.message = message; + } + + public void setPositiveButton(String positiveButton) { + this.positiveButton = positiveButton; + } + + public void setNegativeButton(String negativeButton) { + this.negativeButton = negativeButton; + } + + public String getIcon() { + return icon; + } + + public String getTitle() { + return title; + } + + public String getMessage() { + return message; + } + + public String getPositiveButton() { + return positiveButton; + } + + public String getNegativeButton() { + return negativeButton; + } + + public static class DialogParams{ + public String icon; + public String title; + public String message; + public String positiveButton; + public String negativeButton; + + public void apply(SimpleDialogController controller) { + if (icon != null) { + controller.setIcon(icon); + } + if (title != null) { + controller.setTitle(title); + } + if (message != null) { + controller.setMessage(message); + } + if (positiveButton != null) { + controller.setPositiveButton(positiveButton); + } + if (negativeButton != null) { + controller.setNegativeButton(negativeButton); + } + } + } + +} diff --git a/src/test/java/cn/byhieg/designpatterntutorialtest/SimpleDialogTest.java b/src/test/java/cn/byhieg/designpatterntutorialtest/SimpleDialogTest.java new file mode 100644 index 0000000..002115a --- /dev/null +++ b/src/test/java/cn/byhieg/designpatterntutorialtest/SimpleDialogTest.java @@ -0,0 +1,18 @@ +package cn.byhieg.designpatterntutorialtest; + +import cn.byhieg.designpatterntutorial.builder.SimpleDialog; +import junit.framework.TestCase; + +/** + * Created by shiqifeng on 2017/5/7. + * Mail byhieg@gmail.com + */ +public class SimpleDialogTest extends TestCase { + + public void testBuilder() throws Exception { + SimpleDialog dialog = new SimpleDialog.Builder().setIcon("图标").setMessage("这是Dialog").setPositiveButton("确认").setNegativeButton("否定").create(); + + + } + +} \ No newline at end of file From c41dde8e35e07469c621afc9df071f95994b5d56 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=9F=B3=E7=90=A6=E5=B3=B0?= Date: Tue, 9 May 2017 09:59:08 +0800 Subject: [PATCH 10/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E7=94=9F=E4=BA=A7?= =?UTF-8?q?=E8=80=85=E6=B6=88=E8=B4=B9=E8=80=85-=E9=98=BB=E5=A1=9E?= =?UTF-8?q?=E9=98=9F=E5=88=97=E5=AE=9E=E7=8E=B0?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../concurrent/blocking/ArrayBlock.java | 21 +++++++++++++++---- .../concurrent/blocking/Costumer.java | 2 +- .../concurrent/blocking/Producer.java | 3 +-- .../blockingtest/ArrayBlockTest.java | 2 +- 4 files changed, 20 insertions(+), 8 deletions(-) diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java index b31b674..3687b31 100644 --- a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/ArrayBlock.java @@ -1,7 +1,10 @@ package cn.byhieg.threadtutorial.concurrent.blocking; -import java.util.concurrent.ArrayBlockingQueue; -import java.util.concurrent.BlockingQueue; +import com.sun.scenario.effect.impl.sw.sse.SSEBlend_SRC_OUTPeer; + +import javax.sound.midi.SoundbankResource; +import java.lang.management.LockInfo; +import java.util.concurrent.*; /** * Created by byhieg on 17/5/3. @@ -11,8 +14,18 @@ public class ArrayBlock { private BlockingQueue blockingQueue; - public ArrayBlock(){ - blockingQueue = new ArrayBlockingQueue(1024); + public ArrayBlock(int index) { + switch (index) { + case 0: + blockingQueue = new ArrayBlockingQueue(3); + break; + case 1: + blockingQueue = new LinkedBlockingQueue<>(); + break; + case 2: + blockingQueue = new SynchronousQueue<>(); + break; + } } public BlockingQueue getBlockingQueue() { diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java index d69c647..f88b45f 100644 --- a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Costumer.java @@ -20,7 +20,7 @@ public void run() { super.run(); while (true) { try { - Thread.sleep(2000); + Thread.sleep(5000); String str = blockingQueue.take(); System.out.println(getName() + " 取出数据 " + str); } catch (InterruptedException e) { diff --git a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java index 5298546..a2d12eb 100644 --- a/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java +++ b/src/main/java/cn/byhieg/threadtutorial/concurrent/blocking/Producer.java @@ -14,9 +14,8 @@ public void run() { super.run(); for (int i = 0 ; i < 5;i++) { try { - System.out.println(getName() + " 生产数据"); blockingQueue.put(i + ""); - Thread.sleep(1000); + System.out.println(getName() + " 生产数据"); } catch (InterruptedException e) { e.printStackTrace(); } diff --git a/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java index 8c695b2..c48566c 100644 --- a/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java +++ b/src/test/java/cn/byhieg/threadtutorialtest/concurrenttest/blockingtest/ArrayBlockTest.java @@ -15,7 +15,7 @@ public class ArrayBlockTest extends TestCase { ArrayBlock block; public void setUp() throws Exception { super.setUp(); - block = new ArrayBlock(); + block = new ArrayBlock(2); } public void tearDown() throws Exception { From 5a4753da6357fef702ca6118b6ac07a6fcc7a85f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=9F=B3=E7=90=A6=E5=B3=B0?= Date: Sun, 18 Jun 2017 17:03:55 +0800 Subject: [PATCH 11/17] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E5=BD=92=E5=B9=B6?= =?UTF-8?q?=E6=8E=92=E5=BA=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../cn/byhieg/algorithmtutorial/Sort.java | 54 +++++++++++++++++++ .../algorithmtutorialtest/SortTest.java | 9 +++- 2 files changed, 61 insertions(+), 2 deletions(-) diff --git a/src/main/java/cn/byhieg/algorithmtutorial/Sort.java b/src/main/java/cn/byhieg/algorithmtutorial/Sort.java index 6229a1f..6794e42 100644 --- a/src/main/java/cn/byhieg/algorithmtutorial/Sort.java +++ b/src/main/java/cn/byhieg/algorithmtutorial/Sort.java @@ -128,6 +128,59 @@ public void bubbleSort2(int[] nums) { } } + /** + * 归并排序，将数组一分为二，对于每一子数组继续进行上述步骤，直到子数组只有1个元素，那么自然是有序的。 + * 然后不断合并两个数组，直到合并到整个数组。 + * 时间复杂度o(NlgN) + * 空间复杂度o(N) + * @param nums + */ + public void mergeSort(int[] nums) { + int length = nums.length; + int low = 0; + int high = length - 1; + realSort(nums, low, high); + } + + /** + * 归并排序真正的sort函数 + * @param nums 待排序的数组 + * @param low 最低位 + * @param high 最高位 + */ + private void realSort(int[] nums, int low, int high) { + int mid = (low + high) / 2; + if (low < high) { + realSort(nums, low, mid); + realSort(nums, mid + 1, high); + realMerge(nums, low, mid, high); + } + } + + private void realMerge(int[] nums, int low, int mid, int high) { + int[] tmpNums = new int[high - low + 1]; + int leftPoint = low; + int rightPoint = mid + 1; + int index = 0; + + while (leftPoint <= mid && rightPoint <= high) { + if (nums[leftPoint] < nums[rightPoint]) { + tmpNums[index++] = nums[leftPoint++]; + }else{ + tmpNums[index++] = nums[rightPoint++]; + } + } + + while (leftPoint <= mid) { + tmpNums[index++] = nums[leftPoint++]; + } + while (rightPoint <= high) { + tmpNums[index++] = nums[rightPoint++]; + } + + System.arraycopy(tmpNums, 0, nums, low, tmpNums.length); + } + /** * 快速排序，选定一个切分元素，每一轮排序后，都保证切分元素之前的元素都小于切分元素，切分元素之后的元素都大于切分元素 * 时间复杂度o(NlgN) @@ -263,4 +316,5 @@ public void sink(int [] nums, int i,int n) { } + } diff --git a/src/test/java/cn/byhieg/algorithmtutorialtest/SortTest.java b/src/test/java/cn/byhieg/algorithmtutorialtest/SortTest.java index 08c1d90..046daca 100644 --- a/src/test/java/cn/byhieg/algorithmtutorialtest/SortTest.java +++ b/src/test/java/cn/byhieg/algorithmtutorialtest/SortTest.java @@ -41,8 +41,13 @@ public void tearDown() throws Exception { // new Sort().quickSort(nums); // } - public void testHeapSort() throws Exception { - new Sort().heapSort(nums); +// public void testHeapSort() throws Exception { +// new Sort().heapSort(nums); +// } + + public void testMergeSort() throws Exception { + new Sort().mergeSort(nums); + } } \ No newline at end of file From e5a710dae2385bbff30cd53899a9197a0974df11 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=9F=B3=E7=90=A6=E5=B3=B0?= Date: Sat, 24 Jun 2017 21:44:36 +0800 Subject: [PATCH 12/17] =?UTF-8?q?=E4=BF=AE=E6=94=B9README?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 21 ++++++++++++++---- .../JavaTutorial\347\233\256\345\275\225.jpg" | Bin 353150 -> 0 bytes .../JavaTutorial\347\233\256\345\275\225.png" | Bin 0 -> 400831 bytes 3 files changed, 17 insertions(+), 4 deletions(-) delete mode 100644 "images/JavaTutorial\347\233\256\345\275\225.jpg" create mode 100644 "images/JavaTutorial\347\233\256\345\275\225.png" diff --git a/README.md b/README.md index 49941a0..88bb506 100644 --- a/README.md +++ b/README.md @@ -1,7 +1,8 @@ # JavaTutorial内容说明 该Java教程是学习Java过程中对Java知识点进行梳理。每一个包中的代码都有一个ReadMe来说明该包代码的作用以及知识点。 +src包里面是Java的源码，test包里面是针对源码的测试 -![Alt text](images/JavaTutorial目录.jpg) +![Alt text](images/JavaTutorial目录.png) ## ThreadTutorial内容说明 在源码路径下`cn.byhieg.threadtutorial`中放置的是Java多线程的代码和测试例子，在每一个章的包下，都有一个ReadMe来说明该章的知识点。 @@ -67,9 +68,6 @@ MapTutorial中的知识点有 - TreeMap的使用 - LinkedHashMap的使用 - - - ## AnnotationTutorial内容说明 在源码路径下`cn.byhieg.annotationtutorial`中放置的是Java注解类的代码和测试例子。在每一个包里面，都有一个ReadMe来说明该章的知识点。 @@ -79,7 +77,22 @@ MapTutorial中的知识点有 在源码路径下`cn.byhieg.iotutorial`中放置的是Java io类的代码和测试例子。在每一个包里面，都有一个ReadMe来说明该章的知识点。 +## DesignPattern内容说明 + +在源码路径下`cn.byhieg.designpatterntutorial`中放置的是Java 设计模式的代码和测试的例子。目前有 + +- 代理模式 +- 单例模式 +- builder模式 +## algorithmtutorial内容说明 +在源码路径下`cn.byhieg.algorithmtutorial`中放置的是Java实现的一些算法，内容如下： +- 二叉搜索树 +- 二叉树的常见的算法 +- 查找算法， +- 图的算法(DFS,BFS，Dijkstra) +- 单链表的算法 +- 排序算法。 diff --git "a/images/JavaTutorial\347\233\256\345\275\225.jpg" "b/images/JavaTutorial\347\233\256\345\275\225.jpg" deleted file mode 100644 index a4603a6e1fee9a5143d9d3147e1e181688b9c5e7..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 353150 zcmeEubySq^y0#*SN~s7)BPkuyH6Tb02-1yoGc*jXCSam(+lCcc*lB5B0tL z&N=(rYoFu(_Wtu*>$sNG;vL@idG6=Fulu^Ldjb^ROJY4CdUEgHJuGP{aYf*h>%Dtu z{Etw8pIGyoy#+qqcTkjkd#|vMWCQr-v8|Mb!@Ya>Ga$3%L9@3u_Ku$(R7V7>P; zaQUl$@2Yz!w@<>%I*#t$M|~>tZ+u_^t}+Yv!~XZKdP*@Ew)Ss574XaIFKo*u#L)kx zwcrgFQFop20~6mOYThhsNV(S8W>rIMUI0&L%X?p5tv}&DpM`1R%G$!3ZIGd8AH!3S zU;+<%AM&@u{J*l+S9BB_eh*x*C!IWb$o{$jn=)*I@nGFW64eczzr#)4F9M_3sWbv~ z|EK4_vNns?_Fh;Teu6l6tMC8(=h1SX3py>|2u%I^8;mfs^`21Svygvb#Tpw>ywR-D zQSP>}aS#=IhX0)6_)}Uz;0bTmy#T+yi=PhT|H=c3KbrA$V_o!l^w$fqqc$}+`zAjW zXwy{xT88nHPvG8J=s&p|h!_QvpjC55u(#eU;UN>Xpzis!I?A~CU0{9lL`f=4;(K5} z(x=_s-^_YiFju11(_LZ+63)lIkD8$7)6m~{IUz8S7-6>l5$932=pVze@i8iOx9#t~ zSG9$E&Y#^^@SojrF*lkSz>76|D>c0Z;HyesFr(=x&=dXW0p}#rrw!(%HO-22VLywk9cG5Y0(KxJZQ52^NF`b`Lyr4@ZL6hhVt&QMS7m>TRbmA^!zOp z*MS=x(SQ2aOaGIb{D)X+%tN6jLTvte_FrrHFD9#X)EP(iziq((bkROHnj79uxS;4^ zRW(Xs@ZI12?TSL>99na;?zdDBg!i|+_?}uMH3e5_Vus<*H-XI(_8-fKjgW%--@Vwr zAKHwL(A+*=HOb#D^AYtah`^#C`8O9qE zQJC3FebF!fuoM5UZy(-&j`hEf_IK;~zq|H#vG~`z{BJ=1;|c!Xv-Y>#_@DXZ|Bp2C z^WB$!IUB!ceTsid$;-=2L2+OyZ8eWz-fj(QY#jNNqev$kvtQ9S`Y@T-&gxQcx}4Xv zZ-!=$-ng5ZfHetJ?5+3lW3FQHX;))oB>l=4&HxY30?f+# zts+oW7f1PlO5SMk*WJ}#Vq%{B;rE@9^x%W%G}a9XJ5(#8AAG@Zrh-MYhdegg4IURT zZt2`cWdp+A$7vqOY6nvm-Jc3IvKj;gZ$`)3f(gT^%{ibfD;?q8x}i>y(Om(LTAYFO zZg@%6f&2@d{LeU`aRW6;$lZCRE2BG_McD1QV|={7e;#BV=jh?M>Dd3k<_;qPxI^Ia z7k~fxpI$px7Y=Lvi9+5t+rSqrdWiMaRc@DGiqI_mrFTgnZ();>eRP~%%cZQ|m}p@! z3F3a0=J(0`)vkjcJH@N$PS&!VGj$thUys)61oKoA`vsgn;Kn_S_nO~tPK9b-qE~>d zZlR{b>>tb~kK5a*jM9H4Yw^e@a(o~j+g`#a_netIj%*Jl2SE=f%4cPQ8oWiW&JPMO*>;f7l|ZhB z8z#QY6C%z+?TonET7M#k&5-~nOK%nbvQ;LTMA`y=YLR=N#_=cy_nlf_{xdxMsE+jh zMYd~&M`Vpv=gHPM^{d9>Z_AxZ7l}aW*?#=1s3VDBe%RpOP z+gQiJg@uHwr@y<#*l)Esb`?pu`~7eZ+Ab5 z=9H1cSAzo|4R|B%d24ScV;e+%X;&W+)$oc_#GydWCR>xgnF)I&g!n8y%Ga#E@{;N( zGnJ%qULK z)*-d{6d#{g-?gz}3YQ6N4<#MdoSB`)Q12yu5vW8bZ|0j}uZy@sJ5ic^*KK$h`W~x2GPNX0=qs1?Fn+h018DPCF-x@y&>=TsfN-NltdCj1a z-}wq9fty%ZShL6N51rIY6jktW0pL6W;N^?@p=+OICSB8FlKW-TQu$v#x@YCh1wP zf6c#Btgt}YEJ+k`Z$wHGTeHgQRFIQ1j**1dNE~@gn9BD!YYT0$tqklf*#e;1N>u8y zok|ui%TP8WL%t42)dndTizE1*AF3_y1RuU z3%;{E>eM)X@WKrK8uTLQO@JR6*)stmVw>Tx5{vZ;ub(zLEqxt|6Vv_kdcpHIv( zIiy`>HQE<}xj{f$cy^j%L7p*1SMof5Xw$`+2ES}nY zNFq31B~MqWYgwI$++pW%VT*^#kEj&0-qT~b?6$E{nN|18EY4$u*V5GJk00rsu=W{_ z1P7Bz1N)=Q`O*4rrNyCE4D;a(HRckUpG1!DHj&~E6)7ogQ_6!01D*1rZ~9s2yh*CB zt6mSJ=yXfskmsVw#tKKH)XOxtiO3*3xhpi^rgSmM625$i>x6Ett@y&Pz7%3VD0M0a zzfK&bIV51pH~1Wbe||9@eCYAUJqqo}q(7Ob+ba5`4VNy2l>et*aL$bvGak5jHCkn} z*fu=%hI=GNdFe6GMERCnCMBf)R1DTIKmj&LC7stUZ&M%5Dea+e{CS4dLU7h)+lOJ6Qf9^RQ zLo3v&NB;iRZEsu}v%gt(}6Yb8Hfw3wPoux!3L`EH9gU1)n7l#>Pzdu^rX3A>RJy&PU&&G<7 zojh9WH!n&5B~5DGT=AOP>K;2um;1v}O0EtJe1=qP8g#qcoBGZD^Aaj%Ve3?E>&K-= zol~`Y6j~A-5AUx%13D`xndR;sP4uUwOr^2i8tYB*Maso-C<#Y}j)@mROK))P_$ox3 zGs(S&h8(f=^gzRH_ytpO+`Cg1RE4xeg*s)L4R%JyxL6T1V3u0^U8Jdh+iU29$+9(0 znvB*E6ld?JJ3qNE->*FCXED9R)t{FPn|x}k{^-P`jFG zeysSC2>+JtcCswm$$6BeO%dugoEhwA8AY$eBGx9WnKqJ#uv@AjvOQj3z#!0Fy~vRm z{^8|I>!;|E$nWxol-tqv)>=z%H)f_nvWQ8eG&Y32oP^IK8@zU^X*jq@Q{%K}{qp1K zekbmdi&PKxFcH>#bl6_<&zc%dLdg2zq0C3KfJ1#(*Pox*yOhl7$OPQP>%}7A5^`}H zblRn6pKjQe8@!QlDZ{eHN&=iEZOdAZ8+cdk?A8>4I}wU1hYO`~;Q z$Djg9qgLbw1+CW$w|SiU(zbK)>zSCY>dl+_t+E=1KFLs$IQAWPYuSj*Wa{Hn)g^E3 zLtjKv#uyn9QH|{l36}&$`s*JuoLBCb+@5=j?~YFV;fro3#I2#XM4eFhY6fs zZ=@?Zn_db#6@Ay{qx?d(%ineDiPC#*ucuVFM#&qBKwekb&Op70DqUg7Wx-Rm7CifM9>fMJ}FVvL48E=l=KtNS;MEaGMT=2e>nDk1+jr9g~pH( zQeIK%VJ57ll&E6!>hMS&7eSm?=ylw&aMDn4ms&=jr-|C`*SnwX=7Q7TCvsz3*=5_% zsiN-gk{Qo2(t%10D&Y9$8HKQ!A2<2=8fAo<$Mr3zc;AToSuW$)h*2K3KtEMjdLf98 zIW&5ay-9qYGG68E6vIgA*?i_#;bE}O_C?SdgIDdZKx6QU-rTpr)`=Kt!Zgco%@N?f^>awW z2c8%{uB@TAO&1sdO7Vk3Kx{j`@90GoZ15>G?V0h_`~54p9p}0 zS*OO~tP1#B%>Ny+@Si{XKwvhL9xFV!f4mV<+2aJ{8UUMg_$SII3m)J+3bQr^5}83g z*}`y^e33RHJ^5;=H3-=ZVA!py7s@(?g@qe$jFkN$wBMSrG&N(ky?&aWfyN7UYF*Ak zs;WY*>|Q7 zXYL^JC%xF8kPCJT`(B>yRC`{kO4$}yg~~6sNZYUV#nU_BU-y_Sbw{%bU3yoii6ao5 zFq(0{de?)u78f0rQ!aZm?_r!dg0)75QuNK{&afD>I=dw#@LHoi0J1qaK2-EaiX;sk zwx}|144Dq>3EG^Yf6$S_NM$NYmb`5V^UN5|44Qb01aM!WjsQ?d+}3tUH)LSE0mrMo zY83iS(U-+}(Bp_~39+YNO~=bj`+*!u-EpWKj?C(e$dY>Y`c~1nBaGhbYMkYlu{w@F z5F9=`C=e$9{$gqn=r+mo;Y%W(+meGSr-n`9z4?X)t4V`V#T@(58R%h-*zm`;@=gm& z6Mv+`=ISn-(Pf$D0lAQy2a ze1ZXHbm~zn+n+1YQ(N6nFX$hvl&N2Is8WUD*ocXV(d2aGfAc7>UiL@JQ)OvzKMTggl(ZeYuCjieB5YLf#MUg|#pYhU7Qla4f0Z6xHj=0_bnZ;X}6jGm3M;e96+S{(Rw zy*Xf2Y}Hx>+c&N3wpt3nZAV->A8#m`z?5iM_sh6RW$LxswgWWNw(DJYw+WfOs*c^S zA7VzGS2`EZ7qBq}h@mFPQCI|2A6nn{ zbkfI>m+$ngdhc?LtnkMn%Vvj{PFLLjpcNG-$o+8E?f97rnDN$hZJyCvGxG%Qnx$NT zvuRO6{UT1NwYfP>A%)VfP^o5|w7_y>@$05&cy!A9#M0$9#HZp(4N;$~$P@KNKh3!io#nO`m^fsw zqc-lsJX-BjPTnG>ohkO3E%bKACcTjx%b>2o&IgVra(UF_FRcM$cpiF^*4^BIfE z;WV#u!arbB|FT>BQldyPJcJp|szbtMu-=5`AQ^(>);Ns*%EpY9N&1PG^=V?uO!59c zOQJvr7?!!buuyF@**^yUb+SGst!L}9n()q~dtJg*WsJO3SI=|9pn|&iWcZ|B3_(W2 zwQ$S~Uo3Jvi6G$})|DQ<@>;Ayo(ighA8&3@ODY{M9Ir_*!wCjd81-mbyD+V%T}qRT zUmG?xH;q=LDh#rj7S3pt8Y#U|e`4?&{k?9wm+lGVece@_QWZjYuvoWV0$?#PaB%eM zExtPD$aGHqmb%^ABmdEMzW)44J+2#=60vDLX6@V6oK zbbDidx=JNmy%h$FR2t3d>eSsdVWg07P=OZ~R%priR(ioF=hjmCdn@C)S6LN0wlQKo zRGJ<4iET8>ZIe7E#cH#SSl~=5{6lD8zBbIb^9+TXpkE;ts;)0};Z0luB9lB$csA`0fi{*AJ6FD!3ZCR z$5IPIp2FIjoF;+Ky3li%+P;r?(=x1t$iNvQXe_xeUZ0J0;<`KUDRVu`U>iz*Y?vjR zY?&QS^|f8odrUXf{lsE`HBT)Uj!F1NC0AL6G*`sgUfB*4&AD2%qB2bqr$7FU5~R%M6JfM?}GkJX({Ys4XK{PchgArfVsOipPdr(nB zAiimT(s20)&8zF{lM~l+_QQY*&49_W9_~W*o3vNm3fwY%(M2Ma+k7nAyx!}L!jsG& z5?z6PGgqQL*?c2X5rbtjSC?W;SW{iS(hwlJZiq5Z)PerZd(KZ1iekHo@38d z7Qw5THcQ?T6UOtybF#XAayGC+A2t*%2z}B_Z*Nv)ss=z^U-XkfQ$mxj$PDLMH=w(Z zUh|FYjASmTx~-677U76*AO_WFxmd=3&-;b?s72_0E%mCZdqbuS=L^aU<}#SsPp2bt zw>FDW%XOTJ36?yLL^wVe_E3 zt&E)m$c&T^q%x!X4L4J{*hj0q5U@lJkvy>Xl>o3b3wmz&$EFpa37}}y1#7hs$*sKx zkFQ-wG3F$GXzI=IFaUBo$v)F7rYlp?7%Su!OFc;(qlB8kuvDvMoVY|#CKHQwecO=m zW`FE;T&xTRn7)sf?f163U}z##YEUadMSFq|e;%4tL;-h`$)VQZ zc&~gAqe||`L#zvJy<{`>22tGWbEzf7wSP>=#qp9KtjBc9CgWY#6Bb=gdC(8%M7JIO zx>C^Z+^B9kd7`3Ci1l3g2WPg(W6^63lclpR_})}ObXIiqruAfQfpUR>-BpZ5I2NuU zI5owSyyaz-S{*|-n|nwCtR+kkDl_@wx(glc!^ z8z9a+Muf#qTeLJxG-2Rq`Yh~FFuFL0q4;Nx2D5J+Yz3i@8RG4PfkS z-6U;o9n5+-cCE*t?ogtfI{?|_h%4|X7kKPo)Nr?*i5uhbqW6jX^f?nwAS<)V#`KMf zrY2pl=~rGJT4=I#P)25;91bO60`fu>062b1n@i-B(iiC+R*E7dU+wK8$Zoo7wJ!^+ z4YLaOB0bdNkNm$Lt@b3@IN#6@uV#1Eiak8Jc9_N=)<4w2kf!0Z9@l(N0^&E+Y;gy7 z+H6lX8~9xVP_9QjXvL6G6{|V~>unU>p{m zI`56Cv@Mt9nfjyS-3tF_(@zD?6TAET%1mUd9o8x}O@Y2)uIK}p)Z!OVyE7QRTSVr% z0(Es`XD3aQ`Vpoq4fzW9ZTdko`mN1Nx?7|68v7MSqTFM1osd(#%efzsS_1aVVKwa} zd=A8=m>G;-kEp}=|rBA3jz#JX0PyICIIVYH%H9n$Vr_Bi}!7ro$c6_ zh%~UuUc8{!)E<&$KFK`=SolMHFsTG+qS~<5O;WS=y(g6D>Q-1cwsx|e8F{+PB6lc~ zuU?sMQ}0*gD7o}|Ibi9~D5wn;UtY+4)i|^0dl*RQste4UB){cFbuu+f6K3eI-H>@)&>}?PLlz=zrwcK2@<&bbh^rkWIL3HI@jp_n{_x z9^As%Al}BRYWuV2>^8fsApUSlkwfT32AJUZ-IEn77nd`ZS+}^%hb-D`Y9JT?_j&-m zTcHcIcgPdsJPQ`ZD_M@`>4o2KwA;V$xcmBDqY`skr4|`yqjDJcDgKmVw{`)UN0NS2 ziKaqVd}J{@r8n|~hN{54Onx*)I1IHVBZxqTMzG*uJ-qqQqgZ#OSm%-zQ^Rknn(&PY zy#J&>Ss;&8h9l2PVSQ^Wt3f*<)KGcu$C*YvHiV{I0X|r4SB7ITuCyf`E$kb3BAQfp zp`4mh4(NkS?`erPA+aw%xzZA9G2p9(uUi4;S*!_{Cib4qUi`mfcKVoHeyF_9UgsqjCx~x*2vV8kYz9-Q3)7 zmiVr7GR$#({`PBNx%v3PWx%{lng?UE0*5vT28fEOQ~=-ac+5-i$56SCN{LD)sP9rw^cEMvh(HEEF{c>)AA+lh8&DClgPNCX|WZYD<&4! z@G-@;jB4uh=R#hu)RbAsK0xvZHjeifxjqik9?Gcnj8w|EQput9*!r}b<@dF|=Y3df zofcAP^4auuZu+|N2~ou{Jt+Z8LRpg8%YJ(enn_=E8ltY1&xP7{mEz4YQR6~iR=U)X zKi-SyCKs;BeK{1FwkK>ZyVG(j6Ix%QF2?wf;ySEcK7iGi>tAgaQZG__kFPQe zA)M!n-Mc1L5ePRfv(;mIRA7cR-#a*6 zj;o%dRhqQ}D+lbO+8uIQ%PokI;|YapcFU82xP`VZj=s4xzz)1Y)GdzRQ{IiHM4k?q zrkKbd$b^X?)(vxgCq8(TjQCM2_T0LIBF7W zsoq{i7!k%{-v9u&Lb}Au1=8H%=9FtWSu#{8qe0vzg;HN<{vso#8Nq(3__`vsKN(bO zxrPm8AnM}+SbQh7Dyg9iZG&m}q@Vlp(@!s-e_Q6E^DFEs|0m7s(`eLmuZ1`aOBdZs zI__11sdEu2bD_y=)zhb(q^vZbb?aOUr!tKCq8OurZpzllZm>$b+R857YhpSW$P