Fork me on GitHub
摘要: 题目:Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume that the ... 阅读全文
posted @ 2015-08-23 19:51 __Neo 阅读(153) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["... 阅读全文
posted @ 2015-08-23 19:20 __Neo 阅读(121) 评论(0) 推荐(0) 编辑