05 2019 档案

Binary Tree - Divide Conquer & Traverse
摘要：902. Kth Smallest Element in a BST https://www.lintcode.com/problem/kth-smallest-element-in-a-bst/description?_from=ladder&&fromId=1 578. Lowest Commo 阅读全文
posted @ 2019-05-25 08:58 Jenna777 阅读(222) 评论(0) 推荐(0)
Breadth First Search
摘要：598. Zombie in Matrix https://www.lintcode.com/problem/zombie-in-matrix/description?_from=ladder&&fromId=1 531. Six Degrees https://www.lintcode.com/p 阅读全文
posted @ 2019-05-23 10:38 Jenna777 阅读(199) 评论(0) 推荐(0)
My Light, My Soul
摘要：My Light, My Soul I am leaving this place, this place I've called home, a place I will look back on fondly with nostalgia. I can still see you again, 阅读全文
posted @ 2019-05-20 01:03 Jenna777 阅读(199) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：380. Intersection of Two Linked Lists https://www.lintcode.com/problem/intersection-of-two-linked-lists/description?_from=ladder&&fromId=1 102. Linked 阅读全文
posted @ 2019-05-19 00:34 Jenna777 阅读(112) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：380. Intersection of Two Linked Lists https://www.lintcode.com/problem/intersection-of-two-linked-lists/description?_from=ladder&&fromId=1 102. Linked 阅读全文
posted @ 2019-05-18 12:26 Jenna777 阅读(107) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：625. Patition Array II https://www.lintcode.com/problem/partition-array-ii/description?_from=ladder&&fromId=1 类似快速排序排序的思路去分割即可，遇到不满足即交换。 将一个没有经过排序的整数数 阅读全文
posted @ 2019-05-17 07:53 Jenna777 阅读(94) 评论(0) 推荐(0)
双指针算法
摘要：一、相向双指针 1、一个典型的相向双指针问题就是翻转字符串的问题。 三步翻转法： 2、 给一个字符串，判断这个字符串是不是回文串。我们可以使用双指针算法轻易解决。 Follow Up 1 : 不区分大小写，忽略非英文字母 http://www.lintcode.com/problem/valid-p 阅读全文
posted @ 2019-05-15 03:04 Jenna777 阅读(896) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：382. Triangle Count https://www.lintcode.com/problem/triangle-count/description 148. Sort Colors https://www.lintcode.com/problem/sort-colors/descript 阅读全文
posted @ 2019-05-13 11:51 Jenna777 阅读(109) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：604. Window Sum https://www.lintcode.com/problem/window-sum/description?_from=ladder&&fromId=1 自己写的方法： 九章的答案： 阅读全文
posted @ 2019-05-10 11:47 Jenna777 阅读(91) 评论(0) 推荐(0)
5 - Binary Tree & Tree-based DFS
摘要：93. Balanced Binary Tree https://www.lintcode.com/problem/balanced-binary-tree/description?_from=ladder&&fromId=1 分治法: 方法一： with ResultType 方法二： 阅读全文
posted @ 2019-05-10 09:31 Jenna777 阅读(92) 评论(0) 推荐(0)
5 - Binary Tree & Tree-based DFS
摘要：900. Closest Binary Search Tree Value https://www.lintcode.com/problem/closest-binary-search-tree-value/description?_from=ladder&&fromId=1 1. 非递归方法：求B 阅读全文
posted @ 2019-05-03 08:20 Jenna777 阅读(133) 评论(0) 推荐(0)
4 - BFS & Topological Algorithm
摘要：127. Topological Sorting https://www.lintcode.com/problem/topological-sorting/description?_from=ladder&&fromId=1 1. 用Map来存储入度。可以用数组来存吗？不可以。 Map<Direct 阅读全文
posted @ 2019-05-02 04:34 Jenna777 阅读(121) 评论(0) 推荐(0)