674. Longest Continuous Increasing Subsequence
来源:互联网 发布:mrp软件下载 编辑:程序博客网 时间:2024/04/18 07:16
Given an unsorted array of integers, find the length of longest
continuous increasing subsequence.
int findLengthOfLCIS(int* nums, int numsSize) { int count = 0; int start = 0; int end = 0; int i = 0; if(nums == NULL || numsSize <= 0){ return 0; } if(numsSize == 1) { return 1; } i = 1; start = 0; end = 0; count = 1; while(i < numsSize){ if(nums[i]>nums[end]){ end = i; }else{ count = (end-start+1) > count ? (end-start+1):count; start = i; end = i; } i++; } count = (end-start+1) > count ? (end-start+1):count; return count;}
阅读全文
0 0
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- Longest Continuous Increasing Subsequence
- LWC 49:674. Longest Continuous Increasing Subsequence
- LeetCode 674. Longest Continuous Increasing Subsequence
- leetcode 674. Longest Continuous Increasing Subsequence
- leetcode 674. Longest Continuous Increasing Subsequence
- LeetCode 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence(Java)
- LeetCode 674. Longest Continuous Increasing Subsequence
- LeetCode 674.Longest Continuous Increasing Subsequence
- LeetCode-674. Longest Continuous Increasing Subsequence
- [Lintcode]Longest Increasing Continuous Subsequence
- 工厂模式
- 二叉树的深度
- HDOJ HDU 1068 Girls and Boys
- C# 文件过滤器filter
- hash属性
- 674. Longest Continuous Increasing Subsequence
- Integer to Roman 解法
- Android Sipdroid 对外通话建立过程分析,以及监听通话接通时刻
- 【Hibernate】检索数据的五种方式
- Linux:Linux操作系统Centos7.2版本搭建Apache+PHP+Mysql环境
- Leetcode | Longest Substring Without Repeating Characters
- es6-js
- 关于sublime中文问题
- DPDK学习笔记1--基础概念篇(UIO,大页内存,CPU亲和性,NUMA机制等)