CristianoJason的博客

一、问题描述：Given an arrayof 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 nu

这两道题有一定的联系和区别：这类寻找子序列组合的题目大都可以采取双指针+Map的思想进行处理。Substring with Concatenation of All Words中，给定了一些等长的单词words，要求在指定字符串s中找出这些单词的连续组合序列；Minimum Window Substring中，给定了一个子串t，要求在指定字符串s中找出子串t中所有字母所构成的最短子

一、 问题描述：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.

LeetCode上关于买卖股票的问题一共有五道，题号分别为121，122，123，188，309。此类问题的基本描述即给出一个序列prices[]，prices[i]代表第i天股票的价格。如果当天之前不持有股票，则可以以prices[i]的价格购入股票；如果当天之前持有股票，则可以以prices[i]的价格卖出股票；当然，当天也可任何操作都不进行。目的就是求该阶段的最大收益。

一、 题目描述：Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.For example, given the following matrix:1 0 1 0 01 0 1 1 11 1

一、问题描述：https://leetcode.com/problems/implement-strstr/Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

一、问题描述：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.Converting the input stri

一、问题描述：借助这道题总结一下全排列问题吧https://leetcode.com/problems/permutations/Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following p

当初把自己的代码贴在了discuss上，最近有人关于代码部分问了一些问题，现在总结一下这个题目吧。一、问题描述Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such a

一、问题描述：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.

一、问题描述：There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must

一、问题描述：Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is the smallest in lexicograp

一、问题描述：Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the