FilesExpand file tree

 master

/

spiralMatrixII.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

75 lines (43 loc) · 1.64 KB

 master

/

spiralMatrixII.java

Copy path

Top

File metadata and controls

• Code
• Blame

75 lines (43 loc) · 1.64 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

// Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

// For example,

// Given n = 3,

// You should return the following matrix:

// [

// [ 1, 2, 3 ],

// [ 8, 9, 4 ],

// [ 7, 6, 5 ]

// ]

public class Solution {

public int[][] generateMatrix(int n) {

int[][] spiral = new int[n][n];

if(n == 0) return spiral;

int rowStart = 0;

int colStart = 0;

int rowEnd = n - 1;

int colEnd = n -1;

int number = 1;

while(rowStart <= rowEnd && colStart <= colEnd) {

for(int i = colStart; i <= colEnd; i++) {

spiral[rowStart][i] = number++;

}

rowStart++;

for(int i = rowStart; i <= rowEnd; i++) {

spiral[i][colEnd] = number++;

}

colEnd--;

for(int i = colEnd; i >= colStart; i--) {

if(rowStart <= rowEnd) {

spiral[rowEnd][i] = number++;

}

}

rowEnd--;

for(int i = rowEnd; i >= rowStart; i--) {

if(colStart <= colEnd) {

spiral[i][colStart] = number++;

}

}

colStart++;

}

return spiral;

}

}