LeetCode
文章平均质量分 52
pl_Dong
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Top K Frequent Elements
Top K Frequent Elements原创 2016-09-21 21:18:38 · 250 阅读 · 0 评论 -
[LeetCode] Invert Binary Tree
Invert Binary Tree原创 2016-09-14 17:14:58 · 266 阅读 · 0 评论 -
[LeetCode] Two Sum II - Input array is sorted
Two Sum II - Input array is sorted原创 2016-09-14 15:57:08 · 288 阅读 · 0 评论 -
[LeetCode] Find the Difference
Find the Difference原创 2016-09-13 21:10:10 · 316 阅读 · 0 评论 -
[LeetCode] String to Integer (atoi)
Implement atoi to convert a string to an integer.原创 2016-09-04 10:15:51 · 320 阅读 · 0 评论 -
[LeetCode] Missing Number
question:Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.解题思路: the mi原创 2016-10-25 10:13:46 · 325 阅读 · 0 评论 -
[LeetCode] Single Number III
question:Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example原创 2016-10-25 10:10:14 · 282 阅读 · 0 评论 -
[LeetCode] Maximum Depth of Binary Tree
question:Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.解题思路: 递归求解,返回较大深度int maxD原创 2016-10-25 10:06:14 · 338 阅读 · 0 评论 -
[LeetCode] Binary Tree Inorder Traversal
question:Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3],解题思路:递归vector res; void inorder(TreeNode *root) {原创 2016-10-25 10:17:33 · 361 阅读 · 0 评论