2017年1月2日
137. Single Number II——问题是查找，本质是hash查找，只是记录的是32 bit中各个位出现次数而已
摘要： Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime 阅读全文
posted @ 2017-01-02 21:15 bonelee 阅读(213) 评论(0) 推荐(0)
46. Permutations——本质和树DFS遍历无异 fun: for i in nums fun(i)
摘要： Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: class Solution(object) 阅读全文
posted @ 2017-01-02 20:23 bonelee 阅读(296) 评论(0) 推荐(0)
328. Odd Even Linked List——多利用fake_head
摘要： Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the 阅读全文
posted @ 2017-01-02 19:41 bonelee 阅读(293) 评论(0) 推荐(0)
449. Serialize and Deserialize BST——几乎所有树的面试题目都会回到BFS或者DFS，使用BFS，None节点存#
摘要： Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文
posted @ 2017-01-02 17:23 bonelee 阅读(557) 评论(0) 推荐(0)