Jenna777

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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, 阅读全文

摘要： 380. Intersection of Two Linked Lists https://www.lintcode.com/problem/intersection-of-two-linked-lists/description?_from=ladder&&fromId=1 102. Linked 阅读全文

摘要： 380. Intersection of Two Linked Lists https://www.lintcode.com/problem/intersection-of-two-linked-lists/description?_from=ladder&&fromId=1 102. Linked 阅读全文

摘要： 625. Patition Array II https://www.lintcode.com/problem/partition-array-ii/description?_from=ladder&&fromId=1 类似快速排序排序的思路去分割即可，遇到不满足即交换。 将一个没有经过排序的整数数 阅读全文

摘要： 一、相向双指针 1、一个典型的相向双指针问题就是翻转字符串的问题。 三步翻转法： 2、 给一个字符串，判断这个字符串是不是回文串。我们可以使用双指针算法轻易解决。 Follow Up 1 : 不区分大小写，忽略非英文字母 http://www.lintcode.com/problem/valid-p 阅读全文

摘要： 382. Triangle Count https://www.lintcode.com/problem/triangle-count/description 148. Sort Colors https://www.lintcode.com/problem/sort-colors/descript 阅读全文

摘要： 604. Window Sum https://www.lintcode.com/problem/window-sum/description?_from=ladder&&fromId=1 自己写的方法： 九章的答案： 阅读全文

摘要： 93. Balanced Binary Tree https://www.lintcode.com/problem/balanced-binary-tree/description?_from=ladder&&fromId=1 分治法: 方法一： with ResultType 方法二： 阅读全文