Range Addition II

2017/12/11 posted in  leetcode 

class Solution {
public:
    int maxCount(int m, int n, vector<vector<int>>& ops) {
        for (auto tmp:ops) {
            m = min(m, tmp[0]);
            n = min(n, tmp[1]);
        }
        return m*n;
    }
};

« Minimum Moves to Equal Array Elements

Beauty Contest（旋转卡壳） »

Copyright © 2017 Powered by LZH,  Theme used GitHub CSS.