54. Spiral Matrix

class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
        int cur = 0;
        boolean isSide = true;
        List<Integer> answer = new ArrayList<Integer>();
        int h = matrix.length;
        int w = matrix[0].length; 
        int curH = 0;
        int curW = 0;
        for (int i = 0; i < h * w; i++) {
            if (isSide) {
                if (cur == w - 1) {
                    isSide = false; 
                }
            }
            answer.add(matrix[curH][curW]);
        }
    }
}

이거 시간 있으면 풀 수 있을거 같으데 진짜 도의적으로 전씨 더 기다리게 하면 안될거 같아서 루션이 베껴왔읍니다...

class Solution {
    public List < Integer > spiralOrder(int[][] matrix) {
        List ans = new ArrayList();
        if (matrix.length == 0)
            return ans;
        int r1 = 0, r2 = matrix.length - 1;
        int c1 = 0, c2 = matrix[0].length - 1;
        while (r1 <= r2 && c1 <= c2) {
            for (int c = c1; c <= c2; c++) ans.add(matrix[r1][c]);
            for (int r = r1 + 1; r <= r2; r++) ans.add(matrix[r][c2]);
            if (r1 < r2 && c1 < c2) {
                for (int c = c2 - 1; c > c1; c--) ans.add(matrix[r2][c]);
                for (int r = r2; r > r1; r--) ans.add(matrix[r][c1]);
            }
            r1++;
            r2--;
            c1++;
            c2--;
        }
        return ans;
    }
}

Runtime: 0 ms, faster than 100.00% of Java online submissions for Spiral Matrix.
Memory Usage: 37.1 MB, less than 64.45% of Java online submissions for Spiral Matrix.