@@ -0,0 +1,377 @@
+# http://www.lintcode.com/en/problem/longest-increasing-subsequence/%0A%0A%0A#For %5B5, 4, 1, 2, 3%5D, the LIS is %5B1, 2, 3%5D, return 3%0A#For %5B4, 2, 4, 5, 3, 7%5D, the LIS is %5B2, 4, 5, 7%5D, return 4%0A%0Aclass Solution:%0A    %22%22%22%0A    @param nums: The integer array%0A    @return: The length of LIS (longest increasing subsequence)%0A    %22%22%22%0A    def longestIncreasingSubsequence(self, nums):%0A        pass

find longest increasing subsequence in progress