LeetCode-485 Max Consecutive Ones
来源:互联网 发布:汉仪中黑简体下载 mac 编辑:程序博客网 时间:2024/06/03 17:46
题目描述只有一句话
Given a binary array, find the maximum number of consecutive 1s in this array.
给一个二进制数组,找 1 的最长连续子串,输出其长度
思路为设一个变量temp作为统计连续1的个数,从头开始统计,假设当前位为1,则 temp++,否则连续被打断,ans与temp作比较,取大者,temp更新为零,继续向下统计,因为最后一位可能是1,所以要在循环外加一个比较,返回大者
题目链接
代码如下:
class Solution {public: int findMaxConsecutiveOnes(vector<int>& nums) { int ans = 0, temp = 0; for (int i = 0; i < (int)nums.size(); i++) { if (nums[i]) temp++; else { ans = max(temp, ans); temp = 0; } } return max(ans, temp); }};
阅读全文
0 0
- [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
- 【LeetCode】485 Max Consecutive Ones
- LeetCode-485 Max Consecutive Ones
- Max Consecutive Ones[LeetCode 485]
- LEETCODE--Max Consecutive Ones
- LeetCode: Max Consecutive Ones
- 【leetcode】Max Consecutive Ones
- LeetCode:Max Consecutive Ones
- LeetCode Max Consecutive Ones
- LeetCode Max Consecutive Ones
- 3D轮播图
- 通信协议--tcp、udp
- Eclipse/MyEclipse设置个性化代码注释模板
- Android 中NavigationView的使用
- GPS数据包格式+数据解析
- LeetCode-485 Max Consecutive Ones
- 覆铜和网络间距线宽度的规则设计
- 清除缓存
- 进程间通信—local socket
- sizeof()计算结构体的大小
- C语言常见的排序算法
- node介绍和mongodb数据库的安装
- 100行python代码爬取5万条网易新闻评论
- 如何去ping一个网站?ping是什么意思