Longest Continuous Increasing Subsequence

很朴素的做法，没有太多技巧性的东西了

class Solution(object):
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return 0

        result = 1
        count = 1
        n = len(nums)
        for i in xrange(1, n):
            if nums[i] > nums[i - 1]:
                count += 1
            else:
                count = 1
            result = max(result, count)
        return result