判断子序列https://leetcode-cn.com/problems/is-subsequence/
双指针解法
bool isSubsequence(char * s, char * t){
while(*s && *t){
if(*s == *t){
s++;
}
t++;
}
if(*s == ' '){
return true;
}else{
return false;
}
}
搜索二维矩阵 IIhttps://leetcode-cn.com/problems/search-a-2d-matrix-ii/
bool searchMatrix(int** matrix, int matrixSize, int* matrixColSize, int target){
int i = matrixSize - 1,j = 0;
while(i >= 0 && j <* matrixColSize){
if(matrix[i][j] == target){ return true;}
else if(matrix[i][j] > target){i--;}
else {j++;}
}
return false;
}
差的绝对值为 K 的数对数目https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k/
暴力循环遍历
int countKDifference(int* nums, int numsSize, int k){
int i,j;
int ans = 0;
for(i=0;i
