Fork me on GitHub
摘要: Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), retur 阅读全文
posted @ 2017-05-25 23:04 hellowOOOrld 阅读(112) 评论(0) 推荐(0)
摘要: Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values 阅读全文
posted @ 2017-05-25 20:28 hellowOOOrld 阅读(123) 评论(0) 推荐(0)
摘要: Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. 思路: 首先,将 阅读全文
posted @ 2017-05-25 10:03 hellowOOOrld 阅读(136) 评论(0) 推荐(0)