Want to know:

先swap upside down，再symmetric （转置） // first upside down for(int i=0; i<n/2; i++){ for(int j=0; j<n; j++){ int temp = matrix[i][j]; matrix[i][j] = matrix[n-1-i][j]; matrix[n-1-i][j] = temp; } } // then swap symmetrically for(int i=0; i<n; i++){ for(int j=i+1; j<n; j++){ int temp = matrix[i][j]; matrix[i][j] = matrix[j][i]; matrix[j][i] = temp; } }

Get a detailed, AI-powered explanation for this question and thousands more on StudyFetch.