[LeetCode]554. Brick Wall

[LeetCode]554. Brick Wall

题目描述

思路

实际上是计算数组中重复出现数字的最大值
以题目为例
我们需要计算的是
1 3 5
3 4
1 4
2
3 4
1 4 5
这些数字中重复出现最多次的数字

代码

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;

class Solution {
public:
    int leastBricks(vector<vector<int>>& wall) {
        unordered_map<int, int> um;
        for (vector<int> vec : wall) {
            for (int i = 0; i < vec.size() - 1; ++i) {
                if (i)
                    vec[i] += vec[i - 1];
                ++um[vec[i]];
            }
        }
        int count = 0;
        for (auto p : um) {
            count = max(count, p.second);
        }
        return wall.size() - count;
    }
};

int main() {
    vector<vector<int>> wall = { {1,2,2,1}, {3,1,2}, {1,3,2}, {2,4}, {3,1,2}, {1,3,1,1} };
    Solution s;
    cout << s.leastBricks(wall) << endl;

    system("pause");
    return 0;
}