Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Solution {
- static int[] reverseDiagonal(int N, int M, int[][] A) {
- int[] result = new int[N * M];
- int pos = 0;
- for (int i = 0; i < M + N - 1; i++) {
- for (int j = 0; j <= i; j++) {
- int k = i - j;
- if (j >= N || k >= M) {
- continue;
- }
- result[pos++] = A[j][k];
- }
- }
- return result;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement