stophil的专栏

class Solution {public:    bool canJump(int A[], int n) {        int reach=0;        for(int i=0;i        {            if(i            {                reach=max(reach,i+A[i]);     

class Solution {public://贪心法，低进高出，把所有正的价格差价相加起来。    int maxProfit(vector &prices) {    int n=prices.size();    if(n    return 0;    int profit=0;    int minbuy=prices[0];    for(int

class Solution {public:    bool isInterleave(string s1, string s2, string s3) {        int m=s1.size();        int n=s2.size();        int k=s3.size();        if(m+n!=k)        return fa

class Solution {public:    int minPathSum(vector > &grid) {int m=grid.size();int n=grid[0].size();vector> dp(m,vector(n,0));dp[0][0]=grid[0][0];for(int i=1;i{    dp[i][0]=dp[i-1][0]+

class Solution {public:    bool wordBreak(string s, unordered_set &dict) {        int n=s.size();        vector dp(n+1,false);        //dp[i]表示以第一个字符开始的，长度为i的substring 是不是可以拆分成单词，从左往右推进，每到一个

/** * Definition for undirected graph. * struct UndirectedGraphNode { *     int label; *     vector neighbors; *     UndirectedGraphNode(int x) : label(x) {}; * }; */class Solution {

class Solution {public:    double pow(double x, int n) {       if(n==0)       return 1;       if(n==1)       return x;       double tmp=pow(x,abs(n/2));       if(n>0)       {     

class Solution {public:    int maxArea(vector &height) {        int l=0;        int r=height.size()-1;        int ret=0;        int area=0;        while(l        {            area=mi

class Solution {public:    int maxProfit(vector &prices) {        int n=prices.size();        if(n        return 0;        vector left(n,0);        vector right(n,0);        int minbuy

class Solution {public:    int minDistance(string word1, string word2) {        int m=word1.size();        int n=word2.size();        vector> dp(m+1,vector(n+1));        for(int i=0;i   

class Solution {public:    int numDecodings(string s) {        int n=s.size();        if(n==0)        return 0;        vector dp(n,0);        if(s[0]=='0')        return 0;        if

class Solution {public:    void generate(int n,int l,int r,string tmp,vector&ret)    {        if(l==n&&r==n)        {            ret.push_back(tmp);            return;        }     

class Solution {public:    bool DFS(vector>&board,string word,int step,int x,int y,vector> &visited)    {        if(step==word.size())        {            return true;        }        

class Solution {public:    int lengthOfLongestSubstring(string s) {        int ASCII_MAX=26;        int last[ASCII_MAX];        fill(last,last+ASCII_MAX,-1);        int len=0;        int

class Solution {public:    int minimumTotal(vector > &triangle) {        int m=triangle.size();        for(int i=m-2;i>=0;i--)        {//triangle[i][j表示从底边出发，到达i,j点的最短路径的长度            for(

class Solution {public:    int numDistinct(string S, string T) {        int m=S.size();        int n=T.size();        vector> dp(m+1,vector(n+1));        dp[0][0]=1;        //dp[i][j]表示T

class Solution {public:    int reverse(int x) {        if(x==0) return 0;        int flag=x>0?1:-1;        int t=abs(x);        int ret=0;        while(t>0)        {            int t

class Solution {public:    bool isPalindrome(int x) {        if(x        return false;        if(x==0)        return true;        int ret=0;        int tmp=0;        int t=x;     

class Solution {public:    string multiply(string num1, string num2) {        int data[100000]={0};        reverse(num1.begin(),num1.end());        reverse(num2.begin(),num2.end());       

class Solution {public:    int divide(int dividend, int divisor) {         bool sign=(dividend0)||(dividend>0&&divisor        long long a=abs((double)dividend);        long long b=abs((doubl

class Solution {public:    vector spiralOrder(vector > &matrix) { int minX,minY,maxX,maxY,x,y; vector ret; if(matrix.size()==0)    return ret; minX=minY=0; maxX=matrix.size()-1; maxY

/** * Definition for a point. * struct Point { *     int x; *     int y; *     Point() : x(0), y(0) {} *     Point(int a, int b) : x(a), y(b) {} * }; */class Solution {public:   

/** * Definition for an interval. * struct Interval { *     int start; *     int end; *     Interval() : start(0), end(0) {} *     Interval(int s, int e) : start(s), end(e) {} * }; */

/** * Definition for an interval. * struct Interval { *     int start; *     int end; *     Interval() : start(0), end(0) {} *     Interval(int s, int e) : start(s), end(e) {} * }; */

class Solution {public:    string minWindow(string S, string T) {        int snum=S.size();        int tnum=T.size();        int minbegin=0;        int minend=0;        int minlength=snu

class Solution {public:    vector > generate(int numRows) {        vector> ret;        if(numRows==0)        return ret;        vector tmp;        tmp.push_back(1);        ret.push_bac

class Solution {public:    vector getRow(int rowIndex) {        vector ret;        for(int i=0;i        {            ret.push_back(1);            for(int j=i-1;j>0;j--)            { 

class Solution {public:    vector > generateMatrix(int n) {        vector> matrix(n,vector(n));        int begin=0;        int end=n-1;        int num=1;        while(begin        { 

class Solution {public:    int removeDuplicates(int A[], int n) {        // IMPORTANT: Please reset any member data you declared, as        // the same Solution instance will be reused for eac

class Solution {public:    int removeDuplicates(int A[], int n) {        // IMPORTANT: Please reset any member data you declared, as        // the same Solution instance will be reused for eac

class Solution {public:    int search(int A[], int n, int target) {        // IMPORTANT: Please reset any member data you declared, as        // the same Solution instance will be reused for e

class Solution {public:    int threeSumClosest(vector &num, int target) {        int result=0;        if(num.size()==3) return num[0]+num[1]+num[2];        int mincloset =INT_MAX;        s

class Solution {public:    int removeElement(int A[], int n, int elem)     {        int index=0;        int length=0;       for(int i=0;i          {           if(A[i]!=elem)         

class Solution {public:    void rotate(vector > &matrix) {        int n=matrix.size();        for(int i=0;i        {          for(int j=0;j            {                swap(matrix[i][j

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

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

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

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

class LRUCache{public:    LRUCache(int capacity) {        cap=capacity;        head=new ListNode(0,0);        tail=new ListNode(0,0);        head->left=NULL;        head->right=tail; 

class Solution {public:    string longestPalindrome(string s) {        size_t n=s.size();        bool dp[1000][1000];        int startpos=0;        int maxlen=1;        for(size_t i=0;i