LeetCode 554. 砖墙

 

思路#

方法：哈希表#

class Solution {
public:
    int leastBricks(vector<vector<int>>& wall) {
        unordered_map<int, int> mp;
        for(int i = 0; i < wall.size(); ++i) {
            int sum = 0;
            for(int j = 0; j < wall[i].size()-1; ++j) {
                sum += wall[i][j];
                if(mp.count(sum) == 0) {
                    mp[sum] = 1;
                } else {
                    mp[sum]++;
                }
            }
        }

        int height = wall.size();
        int res = height;
        for(auto iter = mp.begin(); iter != mp.end(); ++iter) {
            if(height - iter->second < res) {
                res = height - iter->second;
            }
        }

        return res;
    }
};

 

原文 ： LeetCode官方题解 - 砖墙