第三天,本来想试试Markdown编辑器的,结果发现不会用,心塞
老规矩,先贴原题:(话说回来,我这个算不算侵权啊,别被leetcode告了,我个穷逼可没钱打官司啊……)
Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
Input: [1,1,0,1,1,1] Output: 3 Explanation: 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
and1
. - The length of input array is a positive integer and will not exceed 10,000
这个题蛮简单,就是求一串01中最长的连续的1的个数,那么我只要设一个数用来记录最大数,另设一个数存放当前扫描到的连续的1的个数,如果碰到零或者扫描完就和之前记录的最大数作比较,如果更大则替换,即解决。
贴出我的C代码:
int findMaxConsecutiveOnes(int* nums, int numsSize) {
int output=0, cnt=0;
int i=0;
for(i=0; i<numsSize; i++)
{
if(*(nums+i)==1)
{
cnt++;
}
else
{
cnt=0;
}
output=cnt>output?cnt:output;
}
return output;
}