-
-
Save mariiaKolokolova/f34c9e408db1ff93c46c82f111b38e86 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package maricka.kolokolova; | |
public class Main { | |
public static void main(String[] args) { | |
// TODO Auto-generated method stub | |
int[][] array = { { 1, 2, 3, 4, 5, 6 }, { 1, 2, 3, 4, 5, 6 }, { 1, 2, 3, 4, 5, 6 }, { 1, 2, 3, 4, 5, 6 }, | |
{ 1, 2, 3, 4, 5, 6 }, { 1, 2, 3, 4, 5, 6 } }; | |
int n = 6; | |
System.out.println("Old array:"); | |
for (int i = 0; i < array.length; i++) { | |
for (int j = 0; j < array[0].length; j++) { | |
System.out.print(array[i][j] + " "); | |
} | |
System.out.println(); | |
} | |
for (int i = 0; i < n / 2; i++) { | |
for (int j = i; j < n - 1 - i; j++) { | |
int t; | |
t = array[i][j]; | |
array[i][j] = array[n - 1 - j][i]; | |
array[n - 1 - j][i] = array[n - 1 - i][n - 1 - j]; | |
array[n - 1 - i][n - 1 - j] = array[j][n - 1 - i]; | |
array[j][n - 1 - i] = t; | |
} | |
} | |
System.out.println("New array 90:"); | |
for (int i = 0; i < array.length; i++) { | |
for (int j = 0; j < array[0].length; j++) { | |
System.out.print(array[i][j] + " "); | |
} | |
System.out.println(); | |
} | |
for (int i = 0; i < n / 2; i++) { | |
for (int j = i; j < n - 1 - i; j++) { | |
int t; | |
t = array[i][j]; | |
array[i][j] = array[n - 1 - j][i]; | |
array[n - 1 - j][i] = array[n - 1 - i][n - 1 - j]; | |
array[n - 1 - i][n - 1 - j] = array[j][n - 1 - i]; | |
array[j][n - 1 - i] = t; | |
} | |
} | |
System.out.println("New array 180:"); | |
for (int i = 0; i < array.length; i++) { | |
for (int j = 0; j < array[0].length; j++) { | |
System.out.print(array[i][j] + " "); | |
} | |
System.out.println(); | |
} | |
for (int i = 0; i < n / 2; i++) { | |
for (int j = i; j < n - 1 - i; j++) { | |
int t; | |
t = array[i][j]; | |
array[i][j] = array[n - 1 - j][i]; | |
array[n - 1 - j][i] = array[n - 1 - i][n - 1 - j]; | |
array[n - 1 - i][n - 1 - j] = array[j][n - 1 - i]; | |
array[j][n - 1 - i] = t; | |
} | |
} | |
System.out.println("New array 270:"); | |
for (int i = 0; i < array.length; i++) { | |
for (int j = 0; j < array[0].length; j++) { | |
System.out.print(array[i][j] + " "); | |
} | |
System.out.println(); | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment