Matrix Zigzag Traversal(LintCode)

 1 public class Solution {
 2     /**
 3      * @param matrix: a matrix of integers
 4      * @return: an array of integers
 5      */ 
 6     public int[] printZMatrix(int[][] matrix) {
 7         int m = matrix.length;
 8         int n = matrix[0].length;
 9         int l = matrix.length*matrix[0].length;
10         int[] result = new int[l];
11         
12         int d = -1;
13         int x = 0;
14         int y = 0;
15         for(int i=0;i<l;i++) {
16             result[i] = matrix[x][y];
17             
18             if(x+d < 0 && y < n-1 || x+d >= m && y >= 0) {
19                 d = -d;
20                 y++;
21             }else {
22                 if(y-d < 0 && x < m-1 || y-d >= n && x >= 0) {
23                     d = -d;
24                     x++;
25                 }else {
26                     x = x + d;
27                     y = y - d;
28                 }
29             }
30         }
31         
32         return result;
33     }
34 }