zoukankan      html  css  js  c++  java
  • 554. Brick Wall

    There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. You want to draw a vertical line from the top to the bottom and cross the least bricks.

    The brick wall is represented by a list of rows. Each row is a list of integers representing the width of each brick in this row from left to right.

    If your line go through the edge of a brick, then the brick is not considered as crossed. You need to find out how to draw the line to cross the least bricks and return the number of crossed bricks.

    You cannot draw a line just along one of the two vertical edges of the wall, in which case the line will obviously cross no bricks.

    Example:

    Input: [[1,2,2,1],
            [3,1,2],
            [1,3,2],
            [2,4],
            [3,1,2],
            [1,3,1,1]]
    
    Output: 2
    
    Explanation: 
    

    Note:

    1. The width sum of bricks in different rows are the same and won't exceed INT_MAX.
    2. The number of bricks in each row is in range [1,10,000]. The height of wall is in range [1,10,000]. Total number of bricks of the wall won't exceed 20,000.

    Approach #1: C++.

    class Solution {
    public:
        int leastBricks(vector<vector<int>>& wall) {
            int size = wall.size();
            int sum, ans = 0;
            unordered_map<int, int> temp;
            for (int i = 0; i < size; ++i) {
                sum = 0;
                for (int j = 0; j < wall[i].size()-1; ++j) {
                    sum += wall[i][j];
                    temp[sum]++;
                    ans = max(ans, temp[sum]);
                }
            }
            return size - ans;
        }
    };
    

      

    Apparoch #2: Java.

    class Solution {
        public int leastBricks(List<List<Integer>> wall) {
            if (wall.size() == 0) return 0;
            int count = 0;
            Map<Integer, Integer> map = new HashMap<Integer, Integer>();
            for (List<Integer> list : wall) {
                int length = 0;
                for (int i = 0; i < list.size() - 1; ++i) {
                    length += list.get(i);
                    map.put(length, map.getOrDefault(length, 0) + 1);
                    count = Math.max(count, map.get(length));
                }
            }
            return wall.size() - count;
        }
    }
    

      

    Approach #3: Python.

    class Solution(object):
        def leastBricks(self, wall):
            """
            :type wall: List[List[int]]
            :rtype: int
            """
            d = collections.defaultdict(int)
            for line in wall:
                i = 0
                for brick in line[:-1]:
                    i += brick
                    d[i] += 1
            return len(wall)-max(d.values() + [0])
    

      

    Time SubmittedStatusRuntimeLanguage
    a few seconds ago Accepted 48 ms python
    2 minutes ago Accepted 35 ms java
    2 hours ago Accepted 52 ms cpp
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    SQL Server 判断各种对象是否存在和sysobjects的关系
    SQL Server 通过“with as”方法查询树型结构
    js Iframe与父级页面通信及IE9-兼容性
    SQL Server Update 链接修改和when的应用
    C# 使用表达式树获取特性的值
    .Net Core 防止跨站点请求伪造
    SQL Server 待定
    C# Http请求
    C# Linq 笛卡尔积
    SQL Server 存储过程、函数、触发器的定义
  • 原文地址:https://www.cnblogs.com/h-hkai/p/9984481.html
Copyright © 2011-2022 走看看