LeetCode
zhouyelihua
昨夜星辰昨夜风
展开
-
Minimum Path Sum Total Accepted: 34975 Total Submissions: 109325
题目来自于:LeetCodehttps://leetcode.com/problems/minimum-path-sum/Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of原创 2015-04-22 16:30:39 · 650 阅读 · 0 评论 -
H-Index Total Accepted: 3191 Total Submissions: 14098
Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.According to the definition of h-index on Wikipedia: "A原创 2015-09-06 11:30:49 · 626 阅读 · 0 评论 -
Single Number
https://leetcode.com/problems/single-number/这是来自于leetcode上的一道题目。这里主要强调的是解决题目时候必须数学先行。题目虽然很简单,不假思考就可以给出几个很直观的答案,但是由于时间复杂度是O(nlogn)空间复杂度是O(n)Given an array of integers, every element appears t原创 2015-06-15 21:53:16 · 948 阅读 · 0 评论 -
树中两个节点的最低公共祖先
树是二叉查找树的情况题目来自LeetCode:https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/ Lowest Common Ancestor of a Binary Search Tree Total Accepted: 3402 Total Submissions: 8709 My Subm原创 2015-07-13 11:05:12 · 3598 阅读 · 0 评论 -
Linked List Cycle II
题目来自:https://leetcode.com/problems/linked-list-cycle-ii/Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up: Can you solve it without using extra s原创 2015-07-02 23:25:35 · 666 阅读 · 0 评论 -
Unique Paths I,II
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the原创 2015-06-10 11:24:09 · 1007 阅读 · 0 评论 -
Pascal's Triangle I,II
题目来自于Leetcodehttps://leetcode.com/problems/pascals-triangle/Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1],原创 2015-06-09 00:36:40 · 1508 阅读 · 0 评论 -
Jump Game I , II
https://leetcode.com/problems/jump-game/Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maxi原创 2015-06-03 11:07:50 · 773 阅读 · 0 评论 -
利用二叉树的先序和中序(中序和后序)排列构建二叉树
题目来自于:https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/这一题目其实我想说的还不是我的代码,是之前在写代码中遇到的一个bug问题。后面会进行详细的解释Construct Binary Tree from Preorder and Inord原创 2015-06-19 00:12:04 · 3065 阅读 · 0 评论 -
Flatten Binary Tree to Linked List Total Accepted: 45093 Total Submissions: 156588
题目来自于LeetCodehttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/Given a binary tree, flatten it to a linked list in-place.For example,Given 1原创 2015-04-28 19:17:41 · 663 阅读 · 0 评论 -
Binary Tree Maximum Path Sum
题目来自于LeetCodehttps://leetcode.com/problems/binary-tree-maximum-path-sum/Binary Tree Maximum Path Sum Total Accepted: 37936 Total Submissions: 178064My SubmissionsQuestion Solutio原创 2015-05-10 23:26:33 · 818 阅读 · 0 评论 -
Count Primes Total Accepted: 831 Total Submissions: 6167
题目来自:Leetcodehttps://leetcode.com/problems/count-primes/Count Primes Total Accepted: 831 Total Submissions: 6167My SubmissionsQuestion Solution Description:原创 2015-04-27 22:19:28 · 1012 阅读 · 0 评论 -
Path Sum Total Accepted: 50216 Total Submissions: 168425
题目来自于leetcodehttps://leetcode.com/problems/path-sum/Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the原创 2015-04-21 17:26:54 · 918 阅读 · 0 评论 -
Bitwise AND of Numbers Range Total Accepted: 2859 Total Submissions: 11145
题目来自于leetcodehttps://leetcode.com/problems/bitwise-and-of-numbers-range/Given a range [m, n] where 0 For example, given the range [5, 7], you should return 4.Credits:Special thanks原创 2015-04-20 21:59:50 · 857 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node Total Accepted: 46429 Total Submissions: 128383
题目来自:LeetCodehttps://leetcode.com/problems/populating-next-right-pointers-in-each-node/Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right;原创 2015-04-23 11:44:17 · 583 阅读 · 0 评论 -
Top K Frequent Elements=-leetcode
题目Given a non-empty array of integers, return the k most frequent elements.For example, Given [1,1,1,2,2,3] and k = 2, return [1,2].Note: You may assume k is always valid, 1 ≤ k ≤ number of unique e原创 2016-05-09 00:49:45 · 2193 阅读 · 2 评论