2018年3月26日
Use Array To Implement Queue With Size(bounded)
摘要： 1 /* 2 note, here we use the concept of circle array: so head and tail could be in the middle of it. 3 head index is the 1st real value; tail index is the 1st available slot 4 h t 5 ... 阅读全文
posted @ 2018-03-26 08:47 davidnyc 阅读(227) 评论(0) 推荐(0)
Use LinkedList to implement Queue
摘要： 1 /* H tail 2 (last in) 1->2->3->4 (1st in) 3 o/H 4 first-out 5 6 */ 7 public class UseLinkedListImpleme... 阅读全文
posted @ 2018-03-26 08:02 davidnyc 阅读(188) 评论(0) 推荐(0)
Use LinkedList to Implement Stack
摘要： 1 public class UseLinkedListImplementStack { 2 private ListNode head; 3 private int length ; 4 public UseLinkedListImplementStack() { 5 this.head = null ; 6 this.len... 阅读全文
posted @ 2018-03-26 07:46 davidnyc 阅读(153) 评论(0) 推荐(0)
LT.11.Search Range In Binary Search Tree
摘要： http://www.lintcode.com/en/problem/search-range-in-binary-search-tree/ Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Searc 阅读全文
posted @ 2018-03-26 05:52 davidnyc 阅读(262) 评论(0) 推荐(0)
LF_50_Tweaked Identical Binary Trees
摘要： 时空复杂度: 阅读全文
posted @ 2018-03-26 01:58 davidnyc 阅读(101) 评论(0) 推荐(0)