tonyzhai.com
Tony's Blog写出机器认识的代码很简单，但是写出人看懂的代码却很难。
http://www.tonyzhai.com/
写出机器认识的代码很简单，但是写出人看懂的代码却很难。
http://www.tonyzhai.com/
TODAY'S RATING
>1,000,000
Date Range
HIGHEST TRAFFIC ON
Friday
LOAD TIME
0.9 seconds
hypersun
tony zhai
Suit 503, ●●●●●●●●●●e Building
l●a , Alabama, 70384
United States
View this contact
hypersun
tony zhai
Suit 503, ●●●●●●●●●●e Building
l●a , Alabama, 70384
United States
View this contact
hypersun
tony zhai
Suit 503, ●●●●●●●●●●e Building
l●a , Alabama, 70384
United States
View this contact
BUY YOUR DOMAIN
12
YEARS
1
MONTHS
3
DAYS
GODADDY.COM, LLC
WHOIS : whois.godaddy.com
REFERRED : http://registrar.godaddy.com
PAGES IN
THIS WEBSITE
12
SSL
EXTERNAL LINKS
0
SITE IP
52.24.230.101
LOAD TIME
0.875 sec
SCORE
6.2
Tony's Blog | tonyzhai.com Reviews
https://tonyzhai.com
写出机器认识的代码很简单，但是写出人看懂的代码却很难。
tonyzhai.com
Java | 自知而不自见
http://www.tonyzhai.com/category/java
Algorithm - Create Maximum Number. Nums1 = [3, 4, 6, 5]. 2016 年 1 月 7 日. Algorithm - Coin Change. Coins = [1, 2, 5]. 11 = 5 5 1). 2015 年 12 月 30 日. 经典算法题5 * 查找最小的k个元素 * * 题目 * 输入n个整数，输出其中最小的k个。 Author tony * */[.]. 2015 年 8 月 5 日. 2015 年 7 月 17 日. 2015 年 7 月 16 日. 获取目标字符串在给出的源字符串的开始下标位置， 如 adadsasdababaaabababbcde 代表源串 * 目标串 ababaaaba 出现在源串的下标位置为 8 * * @author tony * */ public class KMP {[.]. 2015 年 7 月 4 日. 2015 年 7 月 3 日. 2015 年 7 月 3 日. 2015 年 7 月 2 日. 2015 年 7 月 1 日. Algorithm - Create Maximum Number.
经典算法题 | 自知而不自见
http://www.tonyzhai.com/classic1
经典面试题1 * 将二叉查找树转换为排序的双向链表，要求不能创建新的存储空间，只允许改变指针方向 * * 思路 * 中序遍历二叉查找树得到的就是从小到大排序后的序列，遍历过程将当前结点左指针指向上一个遍历结点，将上一个节点的右指针指向当前结点 * * 计算时间复杂度 * 中序遍历整棵树n个结点，O(n) * * @author tony * */ public class BinarySearchTreeToTwoWayLinkedList { / 每一次遍历last都是当前链表的最后一个元素，也是中序遍历过程中的上一个结点 private Node last; / 链表第一个元素 private Node first; class Node { private int data; private Node left; private Node right; public Node(int data) { this.data = data; } } /* * 中序遍历二叉排序树，改变左右指针方向，构造双向链表，便利完成后last所指向的结点就是16，也就是链表的最后一个元素 * @param n...
经典算法题 | 自知而不自见
http://www.tonyzhai.com/tag/经典算法题
Algorithm - Create Maximum Number. Nums1 = [3, 4, 6, 5]. 2016 年 1 月 7 日. 经典算法题5 * 查找最小的k个元素 * * 题目 * 输入n个整数，输出其中最小的k个。 Author tony * */[.]. 2015 年 8 月 5 日. Import com.tonyzhai.datastructure.ArrayList; /* * 经典算法题4 * 在二元树中找出和为某一值的所有路径 * * 题目 * 输入一个整数和一棵二元树。 2015 年 7 月 30 日. 经典算法题3 * 求子数组最大和，method1为暴力实现，method2位递归实现，分治算法，method3位复杂度O(n)的实现 * * @author tony */ public class FindMaximumSubArray { /[.]. 2015 年 7 月 29 日. 2015 年 7 月 29 日. 2015 年 7 月 1 日. Algorithm - Create Maximum Number. Algorithm - Coin Change.
书架 | 自知而不自见
http://www.tonyzhai.com/bookshelf
Programming iOS 6, 3rd Edition. Flex 4 In Action. Flex 4 On Java. Learning SQL, 2nd Edition. JavaEE 6 Pocket Guide. Design Patterns in Java, 2nd Edition. Spring Dynamic Modules in Action. Spring in Action, Third Edition. Linux in a Nutshell, 6th Edition. Java Message Service, 2nd Edition. Algorithm - Create Maximum Number. Algorithm - Coin Change. 发表在 经典算法题5 - 查找最小的k个元素.
归并排序（Merge Sort）- Java | 自知而不自见
http://www.tonyzhai.com/mergesort
我们通过调用一个辅助过程MERGE(A, p, q, r)来完成合并，其中A是一个数组，p, q和r是数组下标，满足. 该过程假设子数组A[p. q]和A[q 1. r]都已排好序。 过程MERGE(A, p, q, r)需要O(n)的时间，其中n = r - p 1是待合并元素的总数。 做为 哨兵牌 ，结果每当有一堆只剩 哨兵牌 的时候，它不可能比另外一张牌小，所以会将有效的牌放入输出堆，因为我们事先知道刚好有r - p 1张牌放入输出堆时，则排序完成，所以不用担心哨兵牌也会放入输出堆，执行r - p 1个基本操作，算法就可以停止。 MERGE-SORT(A, p, q, r). 当子数组A[9. 16]包含序列(2, 4, 5, 7, 1, 2, 3, 6)时，调用MERGE(A, 9, 12, 16)第10 17行的操作。 A) (h)在第12 17行循环每次迭代之前，数组A, L和R以及它们各自的下标k, i和j。 这时， A[9. 16]中的子数组已排好序，L和R中的两个哨兵是这两个数组中仅有的两个未被复制回A的元素。 第二行计算A[q 1. r]的长度. MERGE-SORT(A, p, r).
TOTAL PAGES IN THIS WEBSITE
12
Tonyzerk (Antonio Diaz) - DeviantArt
Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ; this.removeAttribute('onclick')" class="mi". Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ; this.removeAttribute('onclick')". Join DeviantArt for FREE. Forgot Password or Username? Digital Art / Student. Deviant for 4 Years. This deviant's full pageview. Last Visit: 3 weeks ago. By moving, adding and personalizing widgets.
88n.eu
TonyZeZ (Loc Pham) - DeviantArt
Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ; this.removeAttribute('onclick')" class="mi". Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ; this.removeAttribute('onclick')". Join DeviantArt for FREE. Forgot Password or Username? Digital Art / Student. Deviant for 6 Months. This deviant's full pageview. Last Visit: 2 weeks ago. By moving, adding and personalizing widgets.
Tony & Zeze
Porque o Samouco não é só, o Largo e a praia com Lisboa ali do outro lado, decidimos agir e isso significa reflectir sobre. o resto aparece "per si", ou então não. Sexta-feira, dezembro 12, 2008. Novo ciclo do ZéZé. Quando tive a ideia de criar um Blog dedicado ao Samouco, era minha intenção utiliza-lo como canal aberto para troca de ideias sobre a Vila, isento de qualquer tipo de preconceito Religiosos ou Políticos. Nunca foi minha intenção achincalh. Despeço-me com um até já e vemo-nos por ai. A ADS va...
TonyZgrywus
Pracujemy obecnie nad nową stronką. Niedługo będzie gotowa. Kontaktuj się z nami pod numerem 663 341 909 oraz pisz na mikolaj.tonyzgrywus@gmail.com. Zapraszamy także na nasz fanpage: https:/ www.facebook.com/tonyzgrywus.poznan.
Tony's Blog
经典算法题5 * 查找最小的k个元素 * * 题目 * 输入n个整数，输出其中最小的k个。 2015 年 8 月 5 日. Import com.tonyzhai.datastructure.ArrayList; /* * 经典算法题4 * 在二元树中找出和为某一值的所有路径 * * 题目 * 输入一个整数和一棵二元树。 2015 年 7 月 30 日. 2015 年 7 月 29 日. 经典面试题1 * 将二叉查找树转换为排序的双向链表，要求不能创建新的存储空间，只允许改变指针方向 * * 思路 * 中序遍历二叉查找树得到的就是从小到大排序后的序列，遍历过程将当前结点左指针指向上一个遍历结点，将上一个节点的右指针指向当前结点 * * 计算时间复杂度 * 中序遍历整棵树n个结点，O(n) * * @author tony * */ public class BinarySearchTreeToTwoWayLinkedList { / 每一次遍历last都是当前链表的最后一个元素，也是中序遍历过程中的上一个结点 private Node last; / 链表第一个元素 private Node first...
Tony Zhang
I'm Tony Zhang. This site is mostly just a placeholder for now. Check back soon! There's something quite rewarding about being able to create something and share it with others. Video games, board games, card games, and everything in between. Hardcore, casual, it doesn't matter. Games have and will always be a large part of my life. Tunes They make everything better. Nothing like listening to some piano rock while going about your day.
tonyzhang88 (Tony W. (张振勇)) - DeviantArt
Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) " class="mi". Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ". Join DeviantArt for FREE. Forgot Password or Username? Digital Art / Professional. Tony W. (张振勇). Group for Indonesian only. Deviant for 4 Years. Tony W. (张振勇). Group for Indonesian only. This deviant's activity is hidden. Deviant since Feb 5, 2011. Why," you ask?
I am Tony | I say whatever I want to say here
I say whatever I want to say here. Have you ever wondered what it takes to do eCommerce? What it takes to compete in retail? The most brutal and competitive market out there, must read this, pretty amazing and very detailed post. This entry was posted in Uncategorized. April 7, 2012. It will only take 1 minute, this piece of music is so amazing, perfect combo from my 2 most favourite instruments. This entry was posted in Uncategorized. March 28, 2012. Day 140, 141, and 142 at Facebook. January 17, 2012.
tonyzhangvfx
为所欲为
