零矩阵
描述:https://leetcode.cn/leetbook/read/array-and-string/ciekh/
错误代码
c语言代码⬇️
void setZeroes(int** matrix, int matrixSize, int* matrixColSize){
int *zeroCol = (int *)malloc(sizeof(int)*matrixSize);
int *zeroRow = (int *)malloc(sizeof(int)*matrixColSize[0]);
memset(zeroCol, 1, matrixSize);
memset(zeroRow, 1, matrixColSize[0]);
for(int i = 0; i < matrixSize; i++){
for(int j = 0; j < matrixColSize[i]; j++){
if(matrix[i][j] == 0){
zeroRow[i] = 0;
zeroCol[j] = 0;
}
}
}
for(int i = 0; i < matrixSize; i++){
if(zeroRow[i] == 0){
for(int j = 0; j < matrixColSize[i]; j++){
matrix[i][j] = 0;
}
}
}
for(int j = 0; j < matrixColSize[0]; j++){
if(zeroCol[j] == 0){
for(int i = 0; i < matrixSize; i++){
matrix[i][j] = 0;
}
}
}
}
错误原因:不要把行当成列啊混蛋matrixSize是指有几行,matrixColSize是指每一行有几列
通过代码
通过代码1⬇️
void setZeroes(int** matrix, int matrixSize, int* matrixColSize){
int *zeroRow = (int *)malloc(sizeof(int)*matrixSize);
int *zeroCol = (int *)malloc(sizeof(int)*(*matrixColSize));
//memset(zeroCol, 1, matrixSize);
//memset(zeroRow, 1, matrixColSize[0]);
for(int i = 0; i < matrixSize; i++){
for(int j = 0; j < *matrixColSize; j++){
if(matrix[i][j] == 0){
zeroRow[i] = 1;
zeroCol[j] = 1;
}
}
}
for(int i = 0; i < matrixSize; i++){
if(zeroRow[i] == 1){
for(int j = 0; j < *matrixColSize; j++){
matrix[i][j] = 0;
}
}
}
for(int j = 0; j < *matrixColSize; j++){
if(zeroCol[j] == 1){
for(int i = 0; i < matrixSize; i++){
matrix[i][j] = 0;
}
}
}
free(zeroCol);
free(zeroRow);
}
通过代码2⬇️
void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
int* zeroRow = (int*)malloc(sizeof(int) * matrixSize);
int* zeroCol = (int*)malloc(sizeof(int) * matrixColSize[0]);
memset(zeroRow, 1, matrixSize);
memset(zeroCol, 1, matrixColSize[0]);
for (int i = 0; i < matrixSize; i++) {
for (int j = 0; j < matrixColSize[0]; j++) {
if (matrix[i][j] == 0) {
zeroRow[i] = 0;
zeroCol[j] = 0;
}
}
}
for (int i = 0; i < matrixSize; i++) {
if (zeroRow[i] == 0) {
for (int j = 0; j < matrixColSize[0]; j++) {
matrix[i][j] = 0;
}
}
}
for (int j = 0; j < matrixColSize[0]; j++) {
if (zeroCol[j] == 0) {
for (int i = 0; i < matrixSize; i++) {
matrix[i][j] = 0;
}
}
}
}
总结
总结:左右不分,行列不分的人真的还有救吗,大概是无了
二维数组的传递要注意