yangjianfeng_的博客

转自烟客旅人 sigmainfy — tech-wonderland.net：http://tech-wonderland.net/blog/summary-of-ksum-problems.htmlSummary for LeetCode 2Sum, 3Sum, 4Sum, K Sum   OverviewI summarize vario

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. 开辟一个长为m+n的数组标记每一行每一列是否出现0.使用O（1）空间方法：使用原数组第一行和第一列记录0 的位置信息将 0 映射到第一行和第一列，使用col 和row 分别记录第一

典型的二叉搜索问题先找到在第几行再找第几个class Solution {public:    bool searchMatrix(vector >& matrix, int target) {        int fir=0,las=matrix.size()-1,le=0,ri=matrix[0].size()-1;        while(fir

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. 给一个整数n，求以1~n共能组成多少种二叉搜索树动态规划题，创建一数组ans

Given n, generate all structurally uniqueBST'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. 1

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 "BANC"

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

题目描述：Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the

问题描述： Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example: