485. Max Consecutive Ones \ 118. Pascal's Triangle

485. Max Consecutive Ones

class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int result_max = 0;
int nums_len = nums.size();
int tmp = 0;

if(!nums_len)
return 0;
else if(nums[0])
{
result_max = 1;
}

for(int i = 0; i < nums_len - 1; i++)
{
if((nums[i] == nums[i + 1]) && nums[i])
{
//  cout << i << " " << tmp << endl;
tmp = (tmp==0)?2:(tmp+1);
if(tmp > result_max)
result_max = tmp;
}
else
{
if(nums[i] || nums[i+1])
{
if(!result_max)
result_max = 1;
}
if(tmp > result_max)
result_max = tmp;
tmp = 0;
}

}

return result_max;
}
};

public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int count = 0, max = 0;
for (int i = 0; i < nums.size(); ++i){
if (nums[i]){
if (++count > max) max = count;
}
else count = 0;
}
return max;
}
};

118. Pascal’s Triangle

class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int> > result;

for(int i = 1; i <= numRows; i++)
{
vector<int> tmp;
for(int j = 1; j <= i; j++)
{
if(j == 1 || j == i)
{
tmp.push_back(1);
}

if(i > 2 && j>1 && j<i)
{
tmp.push_back(result[i-2][j-2]+result[i-2][j-1]);
}
}
result.push_back(tmp);
}

return result;
}
};

class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> res;
for(auto i=0;i<numRows;++i)
{
res.push_back(vector<int>(i+1,1));
for(auto j=1; j<i; ++j) res[i][j] = res[i-1][j-1] + res[i-1][j];
}
return res;
}
};