多点触控及一个华丽的Demo_HenryZhang的博客-程序员宅基地

LeetCode: Best Time to Buy and Sell Stock III

Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. ...You ma

LeetCode: Scramble String, a naive recursion solution

标签： leetcode 算法 DFS

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great ...

LeetCode: Edit Distance of Two Words

标签： leetcode 算法 Dynamic Programming

Edit Distance of the Two WordsGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3...

LeetCode: Unique Binary Search Trees II, Dynamic Programming

标签： leetcode 算法 Dynamic Programming

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n = 3, your program should return all 5 unique BST's shown below. ...

LeetCode: Interleaving String

标签： leetcode Dynamic Programming

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given: s1 = "aabcc", s2 = "dbbca", When s3 = "aadbbcbcac...When s3 = "aadbbbaccc",

LeetCode: Largest Rectangle in Histogram, a naive solution

标签： leetcode Dynamic Programming

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width of each ...

LeetCode: Unique Binary Search Trees, Dynamic Programming

标签： leetcode Dynamic Programming 算法

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

Set Matrix Zeros

标签： leetcode

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Follow up: ...Did you use extra space?...A straight forward solution using O(mn) space is probably a ...

LeetCode: Minimum Window Substring

标签： leetcode Dynamic Programming

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T = "ABC" ...Minimum window is ...

LeetCode: Combination Sum

标签：算法 leetcode

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C ...

A Fast Sudoku Solver: LeetCode Problem

标签：算法 leetcode

This is an efficient and fast solver for Sudoku problem. I passed the large test within 24ms. The problem is below: ...Write a program to solve a Sudoku puzzle by filling the empty cells.

LeetCode: Combination Sum II

标签： leetcode 算法 DFS

Again, similar as the previous one, this combination sum could also be solved by DFS http://blog.csdn.net/u010204902/article/details/8803342 How to make sure that the result is unique? We nee

use map, val> in C++, solve LeetCode Anagrams 240 ms pass large test set

标签： leetcode 算法 C++

Anagrams Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. The basic idea is easy. From the definition of anagrams, we just n

External Merge Sort, time complexity analysis

标签：算法 merge sort

The time complexity of Merge Sort is nlogn. How about the external merge sort? 1. One pass external merge sort step 1. break N data to k groups, each group has N/k data, complexity is N/klog(N/

LeetCode: First Missing Positive

标签： leetcode 算法 bitmap

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) ...