485. Max Consecutive Ones
来源:互联网 发布:java老版经典手机游戏 编辑:程序博客网 时间:2024/06/16 01:59
一、题目:
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.Note: The input array will only contain 0 and 1. The length of input array is a positive integer and will not exceed 10,000
二、解题:
class Solution {public: /* 分析:当遇到一时,启动计数,然后把较大的给max, 当为零时,停止计数,并将计数归零。 */ int findMaxConsecutiveOnes(vector<int>& nums) { int n = nums.size(); int count = 0; //暂时的数量 int max = 0; //最大的数量 for (int i = 0; i < n; i++) { if (nums[i] == 1) { max = max > ++count ? max : count; } else count = 0; } return max; }};
阅读全文
0 0
- 485. Max Consecutive Ones*
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485.Max Consecutive Ones
- C/C++获取操作系统、CPU、内存信息
- linux初学者-磁盘拉伸缩减篇
- 【TensorFlow】Windows10 64位下安装TensorFlow
- jquery系列教程2-style样式操作全解
- webpack如何使用webpack-dev-middleware进行热重载(详解)
- 485. Max Consecutive Ones
- HTTP详解(三):HTTP、TCP的联系与区别
- vim命令行模式命令
- R语言数据挖掘开源工具rattle的安装
- FATAL: Spool Directory source source1: { spoolDir: /usr/local/logs }: Uncaught exception in SpoolDir
- vim插入模式和可视模式
- HTTP详解(四):JAVA实现HTTP请求
- 科研必备的12个网站
- 泛型: 什么是Java泛型?有什么作用?