added Longest Continuous Increasing Subsequence (easy)

Author: minhyeong-joe

Easy/LongestIncreasingSubsequence/README.md

@@ -0,0 +1,25 @@
+
+# Longest Continuous Increasing Subsequence
+[Leetcode Link](https://leetcode.com/problems/longest-continuous-increasing-subsequence/)
+
+## Problem:
+
+Given an unsorted array of integers, find the length of longest `continuous` increasing subsequence (subarray).
+
+## Example:
+
+```
+Input: [1,3,5,4,7]
+Output: 3
+Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. 
+Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4. 
+```
+```
+Input: [2,2,2,2,2]
+Output: 1
+Explanation: The longest continuous increasing subsequence is [2], its length is 1. 
+```
+
+## Note:
+
+Length of the array will not exceed 10,000.

Easy/LongestIncreasingSubsequence/solution.py

@@ -0,0 +1,25 @@
+from typing import List
+
+class Solution:
+ def findLengthOfLCIS(self, nums: List[int]) -> int:
+ if len(nums) <= 1:
+ return len(nums)
+ curLength = 1
+ maxLength = 1
+ for i in range(1, len(nums)):
+ if nums[i-1] < nums[i]:
+ # print(nums[i], "is greater than", nums[i-1])
+ curLength += 1
+ # print("curLength:", curLength)
+ else:
+ curLength = 1
+ maxLength = max(curLength, maxLength)
+ # print("maxLength:", maxLength)
+ return maxLength
+
+
+# test driver
+sol = Solution()
+arr = [1,3,5,4,7]
+print("Input:", arr)
+print("Output:", sol.findLengthOfLCIS(arr))

README.md

@@ -38,6 +38,7 @@ Languages used: Java and Python
  - [Sqrt(x)](Easy/SqrtX)
  - [Shuffle the Array](Easy/ShuffleArray)
  - [Remove Duplicates from Sorted List](Easy/RemoveDuplicatesFromSortedList)
+ - [Longest Continuous Increasing Subsequence](Easy/LongestIncreasingSubsequence)
 - Medium
  - [Minimum Add to Make Parentheses Valid](Medium/MinimumAddtoMakeParenthesesValid)
  - [Distribute Coins in Binary Tree](Medium/DistributionCoinsInBinaryTree)