Leetcode
文章平均质量分 73
小飞侠0070
是谁来自山川湖海,却囿于厨房,昼夜与爱
展开
-
92. Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m, n satisfy the follo原创 2016-03-30 15:30:05 · 169 阅读 · 0 评论 -
52. N-Queens II 回溯算法浅谈
Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.Subscribe to see which companies asked this question问题分析:本题属于典型的回原创 2016-03-31 21:41:18 · 251 阅读 · 0 评论 -
51. N-Queens 回溯算法浅谈
The n-queens puzzle is the problem of placing n queens on ann×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Ea原创 2016-04-01 14:59:24 · 300 阅读 · 0 评论 -
62. Unique Paths 动态规划算法浅谈
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 bo原创 2016-04-01 20:07:26 · 299 阅读 · 0 评论 -
63. Unique Paths II 动态规划的问题
Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.原创 2016-04-01 20:44:48 · 310 阅读 · 0 评论 -
64. 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 right at原创 2016-04-02 09:33:56 · 227 阅读 · 0 评论 -
79. Word Search 回溯算法
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically n原创 2016-04-02 11:22:15 · 316 阅读 · 0 评论 -
93. Restore IP Addresses 回溯算法
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order does原创 2016-04-02 13:14:33 · 295 阅读 · 0 评论 -
60. Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""312""原创 2016-04-02 15:00:58 · 201 阅读 · 0 评论 -
131. Palindrome Partitioning回溯算法
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa","b"],原创 2016-04-02 16:14:31 · 189 阅读 · 0 评论 -
40. Combination Sum II 回溯算法
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.Each number in C may only be used once in the combinatio原创 2016-04-02 17:55:30 · 196 阅读 · 0 评论 -
49. Group Anagrams
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note:For t原创 2016-04-02 18:04:05 · 189 阅读 · 0 评论 -
207. Course Schedule 图的dfs算法
There are a total of n courses you have to take, labeled from 0 ton - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a p原创 2016-04-03 14:32:42 · 248 阅读 · 0 评论 -
210. Course Schedule II 图的dfs算法
There are a total of n courses you have to take, labeled from 0 ton - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a p原创 2016-04-03 17:35:23 · 205 阅读 · 0 评论 -
209. Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.For example, given the array [2,3,1原创 2016-04-03 17:38:22 · 153 阅读 · 0 评论 -
69. Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.Subscribe to see which companies asked this question分析:数学方法解答。很奇怪我的不能用平常算法写完。参照别的。代码:class Solution {public: int原创 2016-04-06 19:34:54 · 195 阅读 · 0 评论 -
222. Count Complete Tree Nodes 完全二叉树节点
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely filled,原创 2016-04-06 22:20:31 · 261 阅读 · 0 评论 -
330. Patching Array
Given a sorted positive integer array nums and an integern, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the array. Ret原创 2016-03-24 20:56:19 · 273 阅读 · 0 评论 -
236. Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes原创 2016-03-24 22:21:57 · 196 阅读 · 0 评论 -
189. Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to[5,6,7,1,2,3,4]. Note:Try to come up as many solutions as you ca原创 2016-03-25 13:44:51 · 203 阅读 · 0 评论 -
322. Coin Change 动态规划应用
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of mone原创 2016-04-07 18:43:57 · 345 阅读 · 0 评论 -
227. Basic Calculator II
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces. The integer division should原创 2016-04-07 21:33:16 · 246 阅读 · 0 评论 -
105. Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.Subscribe to see which companies asked this question分析:原创 2016-03-26 09:06:40 · 365 阅读 · 0 评论 -
103. 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 binary tr原创 2016-03-26 12:19:50 · 223 阅读 · 0 评论 -
17. 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 string原创 2016-03-26 12:49:04 · 184 阅读 · 0 评论 -
113. Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \原创 2016-03-26 13:30:20 · 214 阅读 · 0 评论 -
50. Pow(x, n)
Implement pow(x, n).Subscribe to see which companies asked this question解释:递归求解,将复杂度降低。代码:// #define DBL_MAX 1.7976931348623158e+308 /* max value */// #define DBL_MIN 2.2250738585072014e原创 2016-03-26 14:33:37 · 252 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters 最长不重复序列
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For原创 2016-04-12 15:29:26 · 186 阅读 · 0 评论 -
18. 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:Elements原创 2016-04-09 12:15:30 · 165 阅读 · 0 评论 -
1. Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example:Given nums = [2,原创 2016-03-27 10:55:06 · 192 阅读 · 0 评论 -
171. Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z原创 2016-03-27 11:01:38 · 136 阅读 · 0 评论 -
338. Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:For num = 5 y原创 2016-03-27 11:31:15 · 209 阅读 · 0 评论 -
98. Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.The原创 2016-04-12 16:12:10 · 175 阅读 · 0 评论 -
128 Largest Number (自定义比较函数排序)
Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is9534330.Note: The result may be very转载 2016-04-12 21:01:52 · 216 阅读 · 0 评论 -
15. 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,c) m原创 2016-04-12 22:09:03 · 215 阅读 · 0 评论 -
96. Unique Binary Search Trees 动态规划
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \原创 2016-04-09 13:31:23 · 150 阅读 · 0 评论 -
150. Evaluate Reverse Polish Notation 逆波兰式
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1", "+",原创 2016-04-09 14:31:15 · 186 阅读 · 0 评论 -
43. Multiply Strings 字符串乘
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.Subscribe to see which companies asked原创 2016-04-09 16:20:22 · 239 阅读 · 0 评论 -
5. Longest Palindromic Substring 动态规划
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length ofS is 1000, and there exists one unique longest palindromic substring.问题分析:求最长回文子字符串。参考注意原创 2016-04-09 22:16:22 · 816 阅读 · 1 评论 -
61. Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.Subscribe to see which companies as原创 2016-04-10 10:03:22 · 168 阅读 · 0 评论