leetcode554+穿过砖块墙最少砖块,找裂缝最多的位置

https://leetcode.com/problems/brick-wall/description/

class Solution {
public:
    int leastBricks(vector>& wall) {
        map hash;
        int maxcnt = 0;
        for(int i=0; i

你可能感兴趣的:(Leetcode)