## 题目：

Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).

Example 1:

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.

Example 2:

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.

## 分析：

 nums 1 3 5 4 7 res 1 2 3 1 2

 nums 1 3 5 4 7 temp 1 2 3 1 2 res 1 2 3 3 3

## 程序：

C++

class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
if(nums.size() == 0) return 0;
int res = 1;
int max_temp = 1;
for(int i = 1; i < nums.size(); ++i){
if(nums[i] > nums[i-1])
++max_temp;
else
max_temp = 1;
res = max(res, max_temp);
}
return res;
}
};

Java

class Solution {
public int findLengthOfLCIS(int[] nums) {
if(nums.length == 0) return 0;
int res = 1;
int maxTemp = 1;
for(int i = 1; i < nums.length; ++i){
if(nums[i-1] < nums[i])
++maxTemp;
else
maxTemp = 1;
res = Math.max(res, maxTemp);
}
return res;
}
}