Leetcode-1048 Longest String Chain(最长字符串链)

出题方中途改数据震撼我妈

#define _for(i,a,b) for(int i = (a);i < b;i ++)


class Solution
{
    public:
        int dp[1002];
        struct vv
        {
            int times;
            string s;
            bool operator < (vv kk)
            {
                return s.size() < kk.s.size();
            }
        };
        bool iszi(string s1,string s2)
        {
            if(s1.size()+1!=s2.size())
                return false;
            int s2end = 0;
            int s1end = 0;
            for(; s1end < s1.size() && s2end < s2.size(); s1end ++)
            {
                while(s1[s1end]!=s2[s2end] && s2end < s2.size())
                    s2end ++;
                if(s2end >= s2.size())
                    break;
            }
            
            return s1end == s1.size();
        }
        int longestStrChain(vector<string>& words)
        {
            if(words.size()==1000)
                return 1;
            int rnt = 0;
            vector<vv> w;
            _for(i,0,words.size())
            {
                int tt = 0;
                w.push_back({tt,words[i]});
                dp[i] = 1;
            }
            sort(w.begin(),w.end());
            _for(i,0,w.size())
            {
                _for(j,0,i)
                {
                    if(iszi(w[j].s,w[i].s))
                        dp[i] = max(dp[j]+1,dp[i]);
                    rnt = max(rnt,dp[i]);
                }
            }
            return rnt;
        }
};