###### tags: `Weekly Contest`
# Weekly Contest 432

## [Zigzag Grid Traversal With Skip](https://leetcode.com/problems/zigzag-grid-traversal-with-skip/) (<font color=#00B8A3>Easy</font>)

### Solution

#### 時間複雜度:

#### 空間複雜度:

程式碼:

class Solution {
public:
    vector<int> zigzagTraversal(vector<vector<int>>& grid) {
        vector<int> results;
        for (int i = 0; i < grid.size(); i++) {
            if (i % 2)
                for (int j = grid[i].size() - 1; j >= 0; j--) {
                    if ((i + j) % 2 == 0)
                        results.push_back(grid[i][j]);
                }
            else
                for (int j = 0; j < grid[i].size(); j++) {
                    if ((i + j) % 2 == 0)
                        results.push_back(grid[i][j]);
                }
        }
        return results;
    }
};

---

## [Maximum Amount of Money Robot Can Earn](https://leetcode.com/problems/maximum-amount-of-money-robot-can-earn/) (<font color=#FFC011>Medium</font>)

### Solution

#### 時間複雜度:

#### 空間複雜度:

程式碼:

---

## [Minimize the Maximum Edge Weight of Graph](https://leetcode.com/problems/minimize-the-maximum-edge-weight-of-graph/) (<font color=#FFC011>Medium</font>)

### Solution

#### 時間複雜度:

#### 空間複雜度:

程式碼:

---

## [Count Non-Decreasing Subarrays After K Operations](https://leetcode.com/problems/count-non-decreasing-subarrays-after-k-operations/) (<font color=#FF375F>Hard</font>)

### Solution

#### 時間複雜度:

#### 空間複雜度:

程式碼: