leetcode

0 class Solution {

1 typedef tuple<int, int, int> rec_t;

2

3 public:

4 vector<int> findDiagonalOrder(const vector<vector<int>> &nums) const {

5 static rec_t arr[100001];

6 int n = 0;

7 for (int i = 0; i < nums.size(); i++) {

8 for (int j = 0; j < nums[i].size(); j++) {

9 arr[n++] = {-i - j, i, nums[i][j]};

10 }

11 }

12 sort(begin(arr), begin(arr) + n, greater<rec_t>());

13 vector<int> res;

14 for (int i = 0; i < n; i++)

15 res.push_back(get<2>(arr[i]));

16 return res;

17 }

18 };