Longest Increasing Subsequence

class Solution {

public:
    int lengthOfLIS(vector<int>& nums) {

        if( nums.size() == 0 )
            return 0;

        vector<int >memo( nums.size() , 1 );
        for( int i = 1 ; i < nums.size() ; i ++ )
            for( int j = 0 ; j < i ; j ++ )
                if( nums[i] > nums[j] )
                    memo[i] = max( memo[i] , 1 + memo[j] );

        int res = memo[0];
        for( int i = 1 ; i < nums.size() ; i ++ )
            res = max( res , memo[i] );

        return res;
    }
};

• http://www.lintcode.com/zh-cn/problem/longest-increasing-subsequence/
• https://mp.weixin.qq.com/s?__biz=MzA5MzE4MjgyMw==&mid=2649458042&idx=1&sn=d2760fd7726150bbdc90910399c77178&chksm=887eeb72bf09626425a40ab83905e860f7982137483523ee8b702a1ed17e9584029f682f892b&mpshare=1&scene=1&srcid=0801P4WuyqY9MXnJZkOPguo2&key=31a3a388ed6fa873af18da987fde78e2cc112b4d2ef9b8a699c873a472dff31520719e5b192d3851f690a0260182cfd7e6e4ad54de4f712d653f5feab807aa0df5d05cf4ac69ac4bcea8fdf39a34566a&ascene=0&uin=MjU2MDA1MjU1&devicetype=iMac+MacBookPro12%2C1+OSX+OSX+10.11.6+build(15G1217)&version=12020110&nettype=WIFI&fontScale=100&pass_ticket=2Jmm5kTupUDCh4560bZ9uUn7t21STaBDI5TW3%2FoCu68%3D
• http://www.cnblogs.com/grandyang/p/4938187.html