LeetCode
文章平均质量分 65
yy_qlxm
这个作者很懒,什么都没留下…
展开
-
238.Product of Array Except Self
题目:Given an array of n integers where n > 1, nums, return an arrayoutput such that output[i] is equal to the product of all the elements ofnums except nums[i].Solve it without division and in原创 2016-05-11 21:15:24 · 406 阅读 · 0 评论 -
Search in Rotated Sorted Array
题目:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become4 5 6 7 0 1 2).You are given a target value to search. If found in the array ret原创 2015-08-03 21:07:37 · 274 阅读 · 0 评论 -
Valid Sudoku
题目:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character'.'.A partially f原创 2015-08-04 20:44:56 · 370 阅读 · 0 评论 -
Construct Binary Tree from Inorder and Preorder(Inorder and Postorder) Traversal
题目:Given inorder and preorder( inorder and postorder )traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.思想:由树的遍历可知,由中序遍历与后序遍历,原创 2015-08-13 19:35:50 · 417 阅读 · 0 评论 -
Flatten Binary Tree to Linked List
题目:Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1原创 2015-08-13 20:30:13 · 261 阅读 · 0 评论 -
Maximum Depth of Binary Tree
题目: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.思想:二叉树的深度等于左右子树的较原创 2015-08-12 15:38:45 · 351 阅读 · 0 评论 -
Minimum Depth of Binary Tree
题目:思想:有题目可知,最小深度的计算方式是从根节点到最近的叶节点的节点的个数。对于一个空节点,其高度自然为0;对于有一个节点为空,一个节点不为空的情况,根据最小深度的定义方式,应该取非空的节点的高度;对于两者均非空,应该取二者中较小者。代码:/*** Definition for a binary tree node.**/typedef struct Tr原创 2015-08-12 17:05:31 · 299 阅读 · 0 评论 -
Binary Tree Level Order Traversal II
题目:Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,15原创 2015-08-12 15:49:32 · 297 阅读 · 0 评论 -
Binary Tree Zigzag Level Order Traversal
题目:Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given bi原创 2015-08-12 15:21:20 · 247 阅读 · 0 评论 -
Balanced Binary Tree
题目:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees ofevery node never原创 2015-08-12 17:48:27 · 372 阅读 · 0 评论 -
Next Permutation
题目:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest pos原创 2015-08-04 11:19:50 · 321 阅读 · 0 评论 -
Search for a Range
题目:Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not f原创 2015-08-04 15:36:51 · 311 阅读 · 0 评论 -
202_HappyNumber
题目:Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squa原创 2016-02-29 20:43:16 · 497 阅读 · 0 评论 -
3Sum Closest
题目:Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have ex原创 2016-02-29 11:35:14 · 310 阅读 · 0 评论 -
First Missing Positive
题目:Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses c原创 2016-02-29 11:34:33 · 464 阅读 · 0 评论 -
Jump Game II
题目: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 maximum jump length at that position.Your g原创 2016-02-29 11:33:36 · 382 阅读 · 0 评论 -
223_Rectangle Area
题目:Find the total area covered by two rectilinear rectangles in a2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the to原创 2016-03-18 16:28:32 · 287 阅读 · 0 评论 -
205_IsomorphicStrings
题目:Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with原创 2016-03-02 21:41:12 · 359 阅读 · 0 评论 -
Sudoku Solver
题目:Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku pu原创 2015-08-05 17:44:55 · 325 阅读 · 0 评论 -
Combination Sum (II)
题目:1、Given a set of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.The same repeated number may be chosen from C unlimi原创 2015-08-05 21:43:33 · 284 阅读 · 0 评论 -
Search Insert Position
题目:Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the arr原创 2015-08-04 15:51:52 · 288 阅读 · 0 评论 -
Binary Tree Postorder Traversal
题目:Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recursive solution原创 2015-08-11 08:29:36 · 281 阅读 · 0 评论 -
Binary Tree Preorder Traversal
题目:Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive solution原创 2015-08-11 08:53:35 · 303 阅读 · 0 评论 -
Binary Tree Level Order Traversal
题目:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2015-08-11 10:12:36 · 304 阅读 · 0 评论 -
Generate Parentheses
题目:Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "(原创 2015-06-10 16:09:55 · 354 阅读 · 0 评论 -
Valid Parentheses
题目:Given a string containing just the characters '(', ')','{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all原创 2015-06-09 17:29:30 · 233 阅读 · 0 评论 -
Letter Combinations of a Phone Number
题目:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit原创 2015-06-09 10:20:50 · 361 阅读 · 0 评论 -
3Sum Closest
题目:Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have ex原创 2015-06-08 20:45:02 · 245 阅读 · 0 评论 -
Remove Nth Node From End of List
题目:Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end,原创 2015-06-09 16:48:53 · 239 阅读 · 0 评论 -
4Sum
题目:Given an array S of n integers, are there elements a,b, c, and d in S such that a + b +c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:El原创 2015-06-09 15:11:22 · 260 阅读 · 0 评论 -
3SUM
题目:Given an array S of n integers, are there elements a,b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b原创 2015-06-08 16:39:56 · 275 阅读 · 0 评论 -
Longest Common Prefix
题目:Write a function to find the longest common prefix string amongst an array of strings.(写一个求最长前缀的函数)思路:两两相比求最长前缀,如有字符串:"my_date","my_daay","my_day","my_dmonth","my_dyear","my_dmouse",将第一个子串以第二个字串相原创 2015-06-04 16:19:16 · 381 阅读 · 0 评论 -
最长回文子串
最长回文子串 最长回文子串是最初我在网易笔试的时候遇见的,当时天真的把原字符串S倒转过来成为S‘,以为这样就将问题转化成为了求S和S’的最长公共子串的问题,而这个问题是典型的DP问题,我也在前面的文章中介绍了3中解决这个问题的方法。但是非常可惜,后来才知道这个算法是不完善的。那么到底为什么呢?听我慢慢道来。S=“c a b a” 那么 S' = “a b a转载 2015-06-02 19:53:47 · 320 阅读 · 0 评论 -
Merge Two Sorted Lists
题目:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.思路:遍历,排序代码:#include #include using原创 2015-06-09 18:57:34 · 239 阅读 · 0 评论 -
Merge k Sorted Lists
题目:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路:两两个的合并,得到最后的结果。这里采用的是将1,2合并,3,4合并,然后再不断合并,直到满足条件。如果先将1,2合并,再将其结果与3合并,依次类推则会出现超时现象。代码:s原创 2015-06-10 21:10:17 · 272 阅读 · 0 评论 -
Binary Tree Inorder Traversal
题目:Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solution i原创 2015-08-10 21:21:53 · 332 阅读 · 0 评论 -
Minimum Path Sum
题目:Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right whichminimizes the sum of all numbers along its path.Note: You can only move either down or righ原创 2015-08-10 11:45:52 · 316 阅读 · 0 评论 -
Anagrams
题目:Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.思想:首先理解这里的“Anagram”是表示string的单词一样只是排列顺序不同的单词组合,如strs="eat,tea,ate"。理解了“A原创 2015-08-09 17:03:42 · 332 阅读 · 0 评论 -
UniquePaths
题目:思想1:本题可以采用动态规划来解决。由于机器人只能向右或是向下移动,所以对于一个已知的点[i,j],它可由[i-1][j]或是[i][j-1]得到的。设path[i][j]为到达第[i,j]坐标所需要的步数,那么对于path[i][j],可以由两种方式得到path[i-1][j]和path[i][j-1]。所以得到动态规划的状态转移方程path[i][j]=path[i-1]原创 2015-08-09 11:00:34 · 357 阅读 · 0 评论 -
Sqrt(x)
题目:Implement int sqrt(int x).Compute and return the square root of x.思想:对于一个数,其求根号后的数一定小于等于该数,为了能够加快搜索,可以采用二分法来解决问题。注意:如果输入2,则输出1;输入7,输出2。代码:class Solution {public: int mySqrt(原创 2015-08-09 20:41:22 · 309 阅读 · 0 评论