基于架构软件设计-架构真题（五十八）

打卡记录

对角线上不同值的数量差（矩阵对角线遍历 + 前缀和）

链接

class Solution {
public:
    vector<vector<int>> differenceOfDistinctValues(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[0].size();
        vector<vector<int>> ans(m, vector<int>(n));
        for (int s = 1; s <= m + n - 1; ++s) {
            int min_j = max(n - s , 0), max_j = min(m + n - s - 1, n - 1);
            unordered_set<int> st;
            st.clear();
            for (int j = min_j; j < max_j; j++) {
                int i = s - n + j;
                st.insert(grid[i][j]);
                ans[i + 1][j + 1] = st.size();
            }
            st.clear();
            for (int j = max_j; j > min_j; j--) {
                int i = s - n + j;
                st.insert(grid[i][j]);
                ans[i - 1][j - 1] = abs(ans[i - 1][j - 1] - (int)st.size());
            }
        }
        return ans;
    }
};

盛最多水的容器（双指针）

链接

class Solution {
public:
    int maxArea(vector<int> &height) {
        int ans = 0, left = 0, right = height.size() - 1;
        while (left < right) {
            int area = (right - left) * min(height[left], height[right]);
            ans = max(ans, area);
            height[left] < height[right] ? ++left : --right;
        }
        return ans;
    }
};