- 博客(4)
- 收藏
- 关注
RSS订阅原创 Leetcode 257. Binary Tree Paths
DFSclass Solution: """ @param root: the root of the binary tree @return: all root-to-leaf paths """ def binaryTreePaths(self, root): # write your code here if no...
2018-09-13 07:35:26
132
原创 Leetcode 165. Compare Version Numbers
class Solution: """ @param version1: the first given number @param version2: the second given number @return: the result of comparing Find out the largest bit of two version numbe...
2018-09-13 02:26:21
126
原创 Leetcode 191. Number of 1 Bits
"""Using bit operator AND(&) to compare the number with 1,if the last bit of the number is 1 which means we found a 1 bit, then update the count by 1;if the last bit of the number is 0, no nee...
2018-09-13 01:42:04
130
原创 Leetcode 565. Array Nesting
"""max = Max(current_max, max)Use a flag array to mark if current node has been visited before.If it is visited, then we can skip it. Complexity is O(n) as we only go through the array once."""...
2018-09-10 03:20:46
132
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人