tags: Weekly Contest

Weekly Contest 432

Zigzag Grid Traversal With Skip (Easy)

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 (Medium)

Solution

時間複雜度:

空間複雜度:

程式碼:

---

Minimize the Maximum Edge Weight of Graph (Medium)

Solution

時間複雜度:

空間複雜度:

程式碼:

---

Count Non-Decreasing Subarrays After K Operations (Hard)

Solution

時間複雜度:

空間複雜度:

程式碼: