一:三数之和:https://leetcode-cn.com/problems/3sum/
代码;
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(), nums.end());
int N = nums.size();
vector<vector<int> > res;
for (int i = 0; i < N - 2; ++i) {
if (nums[i] > 0) break;
if (i > 0 && nums[i] == nums[i - 1]) continue;
int l = i + 1;
int r = N - 1;
while (l < r) {
int s = nums[i] + nums[l] + nums[r];
if (s > 0) {
--r;
} else if (s < 0) {
++l;
} else {
res.push_back({nums[i], nums[l], nums[r]});
while (l < r && nums[l] == nums[++l]);
while (l < r && nums[r] == nums[--r]);
}
}
}
return res;
}
};
二:托普利茨矩阵:https://leetcode-cn.com/problems/toeplitz-matrix/
代码:
class Solution {
public:
bool isToeplitzMatrix(vector<vector<int>>& matrix) {
int rows =matrix.size();
int cols = matrix[0].size();
int k=rows+cols;
for(int i=1;i<rows;i++)
{
for(int j= 1;j<cols;j++)
{
if(matrix[i-1][j-1]==matrix[i][j])
{
k++;
}
}
}
if((k-1)==rows*cols)
{
return true;
}
else
{
return false;
}
}
};
思路:
划去第一行和第一列,此时k为rows+cols;
遍历剩下元素,并且比较和左上角元素是否相等;
此时如果k=rows+cols+(rows-1)*(cols-1),则返回true