solves longest increasing sub sequence

Author: anishLearnsToCode

README.md

@@ -174,7 +174,7 @@
 | 665 | [Non Deceasing Array](https://leetcode.com/problems/non-decreasing-array) | [![Java](assets/java.png)](src/NonDecreasingArray.java) [![Python](assets/python.png)](python/non_decreasing_array.py) |
 | 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [![Java](assets/java.png)](src/TrimABinarySearchTree.java) [![Python](assets/python.png)](python/trim_a_binary_search_tree.py) |
 | 671 | [Second Minimum Node in Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [![Java](assets/java.png)](src/SecondMinimumNodeInBinaryTree.java) [![Python](assets/python.png)](python/second_minimum_node_in_binary_tree.py) |
-| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | |
+| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [![Java](assets/java.png)](src/LongestContinuousIncreasingSubsequence.java) [![Python](assets/python.png)](python/) |
 | 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | |
 | 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | |
 | 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | |

python/longest_continuous_increasing_subsequence.py

@@ -0,0 +1,13 @@
+from typing import List
+
+
+class Solution:
+    def findLengthOfLCIS(self, nums: List[int]) -> int:
+        current, result = 1, 1
+        for index in range(1, len(nums)):
+            if nums[index] > nums[index - 1]:
+                current += 1
+                result = max(result, current)
+            else:
+                current = 1
+        return result

src/LongestContinuousIncreasingSubsequence.java

@@ -0,0 +1,14 @@
+public class LongestContinuousIncreasingSubsequence {
+    public int findLengthOfLCIS(int[] nums) {
+        int result = 1, current = 1;
+        for (int index = 1 ; index < nums.length ; index++) {
+            if (nums[index] > nums[index - 1]) {
+                current++;
+                result = Math.max(result, current);
+            } else {
+                current = 1;
+            }
+        }
+        return result;
+    }
+}