算法
文章平均质量分 72
小飞侠0070
是谁来自山川湖海,却囿于厨房,昼夜与爱
展开
-
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 · 254 阅读 · 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 · 303 阅读 · 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 · 302 阅读 · 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 · 314 阅读 · 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 · 230 阅读 · 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 · 320 阅读 · 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 · 301 阅读 · 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 · 194 阅读 · 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 · 200 阅读 · 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 · 251 阅读 · 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 · 209 阅读 · 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 · 156 阅读 · 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 · 200 阅读 · 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 · 264 阅读 · 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 · 353 阅读 · 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 · 249 阅读 · 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 · 187 阅读 · 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 · 168 阅读 · 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 · 180 阅读 · 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 · 218 阅读 · 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 · 218 阅读 · 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 · 154 阅读 · 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 · 187 阅读 · 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 · 242 阅读 · 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 · 825 阅读 · 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 · 170 阅读 · 0 评论 -
220. Contains Duplicate III set的应用
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] andnums[j] is at most t and the difference between i and原创 2016-04-13 21:54:04 · 177 阅读 · 0 评论 -
2. Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2016-04-10 10:20:01 · 182 阅读 · 0 评论 -
54. Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You原创 2016-04-10 12:25:57 · 171 阅读 · 0 评论 -
304. Range Sum Query 2D - Immutable 动态规划
Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1,col1) and lower right corner (row2, col2).The above rectangle (with the red bor原创 2016-04-10 15:51:36 · 227 阅读 · 0 评论 -
152. Maximum Product Subarray 动态规划
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest pr原创 2016-04-10 19:21:47 · 210 阅读 · 0 评论 -
151. Reverse Words in a String
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Update (2015-02-12):For C programmers: Try to solve it in-place in O(1原创 2016-04-14 22:24:12 · 147 阅读 · 0 评论 -
166. Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the fractional part is repeating, enclose the repeating part in parentheses.For原创 2016-04-15 12:19:44 · 159 阅读 · 0 评论 -
334. Increasing Triplet Subsequence 动态规划
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should:Return true if there exists i, j, k such that arr[i] arr[j]原创 2016-04-15 18:05:20 · 269 阅读 · 0 评论 -
241. Different Ways to Add Parentheses 分治法的应用
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *.Example 1I原创 2016-04-15 19:08:54 · 260 阅读 · 0 评论 -
312. Burst Balloons dp
Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by arraynums. You are asked to burst all the balloons. If the you burst ballooni you will get nums[原创 2016-04-17 11:16:53 · 214 阅读 · 0 评论 -
139. Word Break 动态规划
Given a string s and a dictionary of words dict, determine ifs can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet",原创 2016-04-30 13:29:06 · 390 阅读 · 0 评论 -
42. Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]原创 2016-04-30 15:18:19 · 188 阅读 · 0 评论 -
343. Integer Break
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, retur原创 2016-04-30 22:05:12 · 195 阅读 · 0 评论 -
315. Count of Smaller Numbers After Self BST
You are given an integer array nums and you have to return a new counts array.The counts array has the property where counts[i] is the number of smaller elements to the right ofnums[i].Example:原创 2016-05-14 16:58:09 · 227 阅读 · 0 评论