[第二轮] 2/18-2/24 CareerCup 1.6

Rotate right. Do the rotate from edges to the central part.

https://gist.github.com/lynntian/5001216

Arthur2012 发表于 2013-2-19 15:19
At first turn 180 degree, and then turn through back-diagonal.
https://github.com/Tedatworking/Care ...

I had difficulty understanding c++ codes. But based on your loops, I think we solve the problem in the same way. ;)

https://github.com/moophis/careercup/blob/master/1.6.cpp
My thought is almost identical with grassgigi

C language: https://gist.github.com/hukun01/5004234

https://github.com/ltongrc/CareerCup/blob/master/1.6.java

https://github.com/quantumrose/C ... ter/1.6.Rotate.java

O(n^2) time, in place

Create a temp array and add to the temp one by one.

     if (clockwise)   temp[j][n - i - 1] = a[i][j];
     if(!clockwise)   temp[n - j - 1][i] = a[i][j];


https://gist.github.com/lazyGoose/5016708

Fanyare 发表于 2013-2-23 00:45
https://github.com/quantumrose/CareerCup/blob/master/1.6.Rotate.java

O(n^2) time, in place

hi, how to calculate the Time Complexity， could you provide me with some reading?

https://gist.github.com/KainuoYU/5017549

filp and transpose!

https://gist.github.com/ThunderXu/5018599
从最外层到最里层逐层反转
顺时针的话：
int temp = mat[j][size-1-i];
mat[j][size-1-i]=mat[i][j];
mat[i][j]=mat[size-1-j][i];
mat[size-1-j][i]=mat[size-1-i][size-1-j];
mat[size-1-i][size-1-j]=temp;
逆时针相反

在纸上画了半天才画出来，还是分成两步的方法简单明了