hkx1030的专栏

状态转换fandp[i][j] = ( dp[i-1][j] && ( s1[i-1] == s3[i+j-1])) || ( dp[i][j-1] && ( s2[j-1] == s3[i+j-1]))

方法1：方法2：class Solution {public: vector > permute(vector &num) { vector > res; if( num.size() <= 1){ res.push_back(num); return res; }

class Solution {public: int minCut(string s) { if( s.size() <= 1) return 0; int size = s.size(); vector > dp( size, vector( size, false)); for( int i =

判断shi'fou'huclass Solution {public: bool isPalindrome(string s) { string tmp = ""; for( int i = 0; i < s.size(); ++i){ if(isalnum(s[i])){ if(isupper(

题目说不允许申请额外空间，一个kong'jiaclass Solution {public: bool isPalindrome(int x) { if( x < 0) return false; int y = 0; int xx = x; while(xx){ y *=

Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),

用动态规划可解。二维数组dp[i][j]

class Solution {public: int singleNumber(int A[], int n) { int res = 0; for( int i = 0; i < n; ++i) res ^= A[i]; return res; }};

偷个懒吧，用个库函数，不然就自己写个kuai'pai

Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.如果有多组相同的也可以放到结果中

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *ad

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

数组col[n] = 表示当前行n对应的

和Best Time to Buy and Sell Stock里面的题目

先用dp[i]表示当前下标之前最低价格，再ba

非递归版:/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class

在N-Queens II

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()",

TLE递归tai'ma

class Solution {public: vector > subsets(vector &S) { return _subsets( S, 0); } vector > _subsets( vector &nums, int index){ vector > res; if( index == nums.size()

状态转换方程：dp[i][j] = dp[i-1

和Subset解法一样class Solution {public: vector > subsetsWithDup(vector &S) { vector > res; set > s; size_t upper_bounds = 1 << S.size(); for( size_t i = 0; i < upper_

leetcode: Word Ladder II

Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].

class Solution {public: int ladderLength(string start, string end, unordered_set &dict) { int shortest = INT_MAX; dict.insert(end); queue > q; q.push( pair( start,

这道题太费力气了，还是证明要直接在纸上画个例子，然后模拟，光想可能很多dong'xi

stl的实现方法，先从后往前找一个相邻的

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool hasCycl

用map保存已有的/** * Definition for undirected graph. * struct UndirectedGraphNode { * int label; * vector neighbors; * UndirectedGraphNode(int x) : label(x) {}; * }; */class Solution

先从左到右遍历，如果i+1再从右到左遍历

注意题中要求只要已出现的s

用next_permutation的方法class Solution {public: vector > permuteUnique(vector &num) { vector > res; if(num.size() <= 1){ res.push_back(num); return res;

直接模拟，意料之中的TLEclass Solution {public: void solveSudoku(vector > &board) { generateCandidates( board, candidates); while( true){ for( int i = 0; i < board.size(); ++i)

设置标记class Solution {public: string convert(string s, int nRows) { if( s == "" || nRows <= 1) return s; vector con( nRows, string()); int i = 0; int r

需要记录当前的仅为carry，而且别忘了要+1class Solution {public: vector plusOne(vector &digits) { int carry = 0; int pos = digits.size() - 1; digits[pos] += 1; for( ; pos >= 0; --

waclass LRUCache{public: LRUCache(int capacity) { cap = capacity; } int get(int key) { if( cache.count( key)){ auto iter = cache[key]; cache

class Solution {public: int longestConsecutive(vector &num) { if( num.size() <= 1) return num.size(); unordered_set nums; for( int i = 0; i < num.size(); ++i){

先二分找到逆序元素的下标，然后用二分法查找两段class Solution {public: int search(int A[], int n, int target) { int index = rotatedOne( A, n, 0, n-1); if( index >= 0){ int res1 = binarySear

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

class Solution {public: int firstMissingPositive(int A[], int n) { if( A == NULL || n == 0) return 1;//这里返回 for( int i = 0; i < n; ){ if( A[i] != i + 1 &&