【Leetcode_easy】674. Longest Continuous Increasing Subsequence
problem
674. Longest Continuous Increasing Subsequence
solution
class Solution { public: int findLengthOfLCIS(vector<int>& nums) { int res = 0, cnt = 0, cur = INT_MAX; for(auto num:nums) { if(num>cur) cnt++; else cnt = 1; res = max(res, cnt); cur = num; } return res; } };
solution2:
class Solution { public: int findLengthOfLCIS(vector<int>& nums) { int res = 0, cnt = 0; for(int i=0; i<nums.size(); ++i) { if(i==0 || nums[i]>nums[i-1]) res = max(res, ++cnt); else cnt = 1; } return res; } };
参考
1. Leetcode_easy_674. Longest Continuous Increasing Subsequence;
2. Grandyang;
完
各美其美,美美与共,不和他人作比较,不对他人有期待,不批判他人,不钻牛角尖。
心正意诚,做自己该做的事情,做自己喜欢做的事情,安静做一枚有思想的技术媛。
版权声明,转载请注明出处:https://www.cnblogs.com/happyamyhope/
心正意诚,做自己该做的事情,做自己喜欢做的事情,安静做一枚有思想的技术媛。
版权声明,转载请注明出处:https://www.cnblogs.com/happyamyhope/