A clear C++ approach. 7ms.


  • 0
    Y
    class Solution {
    public:
        void rotate(vector<vector<int> >& matrix) {
        	int tmp,n=matrix.size();
        	if(n==0) return;
        	if(n==1) return;
        	for(int i=0;i<n/2;i++){
        		for(int j=i;j<n-i-1;j++){
        			tmp=matrix[i][j];
        			matrix[i][j]=matrix[n-j-1][i];
        			matrix[n-j-1][i]=matrix[n-i-1][n-j-1];
        			matrix[n-i-1][n-j-1]=matrix[j][n-i-1];
        			matrix[j][n-i-1]=tmp;
        		}
        	}
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.