Leetcode:485. Max Consecutive Ones 找二进制串连续1最多是多少
来源:互联网 发布:软件开发财务报表 编辑:程序博客网 时间:2024/04/29 21:54
Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
中文描述:给定二进制数组,找到该数组中连续1的最大数。
示例1:
输入: [1,1,0,1,1,1]
输出: 3
说明:前两位数字或后三位数字是连续1位。
连续1的最大数量为3。
代码思路及实现:
/** * 找到连续1最多的个数 * 思路: * 1.如果是1:count+1 * 2.记录当前的Max * 3.遇到0 count变为0 开始新一轮的计数 */ public static int findMaxConsecutiveOnes(int[] nums) { int count = 0; int max = 0; for (int i = 0; i < nums.length; i++) { //找连续1的情况 if (nums[i]==1) { count++; } //更新Max if (count>max) { max = count; } //新一轮开始 if (nums[i]==0) { count = 0; } } return max; }
阅读全文
0 0
- Leetcode:485. Max Consecutive Ones 找二进制串连续1最多是多少
- 485. Max Consecutive Ones 找二进制数中连续1
- LeetCode 485. Max Consecutive Ones
- 【Leetcode】485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- LeetCode - 485. Max Consecutive Ones
- LeetCode--485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- 485. Max Consecutive Ones [LeetCode]
- LeetCode : 485. Max Consecutive Ones
- 【LeetCode】485. Max Consecutive Ones
- LeetCode--485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- leetcode--485. Max Consecutive Ones
- leetcode 485. Max Consecutive Ones
- leetcode 485. Max Consecutive Ones
- LeetCode-485. Max Consecutive Ones
- [LeetCode]485. Max Consecutive Ones
- iOS 内存泄漏三两事
- scala解析xml
- spring的注解 后续更新
- MiniTest学习笔记
- jfinal+Swagger轻松配置前后端接口文档
- Leetcode:485. Max Consecutive Ones 找二进制串连续1最多是多少
- masonry实现不规则图片布局【图】
- 欢迎使用CSDN-markdown编辑器
- Matlab GUI 设计中的一个由于弱类型语言特性导致的 bug
- 【NOIP模拟】 (10.31) T1 机器清洁工
- 怎么利用多线程LRU刷新突破MySQL瓶颈?
- webservice相关知识
- http://cmsblogs.com/
- 系统不支持:sqlsrv windows 2008 r2 下面搭建 iis+sql server +php5.5 环境遇见的一些问题