Leetcode 807. Max Increase to Keep City Skyline

class Solution(object):

    def maxIncreaseKeepingSkyline(self, grid):

        """

        :type grid: List[List[int]]

        :rtype: int

        """

        import numpy as np

        grid=np.array(grid)

        ori=grid.sum()

        for i, _ in enumerate(grid):

            for j, _ in enumerate(grid[i]):

                grid[i][j] = min(max(grid[i]), max(grid[:,j]))

        print(grid)

        ans=0

        for i,_ in enumerate(grid):

            ans+=sum(grid[i])

        return ans-ori

Leetcode 807. Max Increase to Keep City Skyline的相关教程结束。

《Leetcode 807. Max Increase to Keep City Skyline.doc》

下载本文的Word格式文档，以方便收藏与打印。

相关推荐

【LeetCode OJ】Recover Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/recover-binary-search-tree/ We know that the inorder traversal of a binary search tree should be a sorted array. Therefore, we can compare each node w...
2023-08-01编程代码leetcode,oj,recover
【LeetCode OJ】Validate Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/validate-binary-search-tree/ We inorder-traverse the tree, and for each node we check if current_node.val > prev_node.val. The code is as follows. ...
2023-08-01编程代码leetcode,oj,validate
【LeetCode OJ】Binary Tree Level Order Traversal

Problem Link: https://oj.leetcode.com/problems/binary-tree-level-order-traversal/ Traverse the tree level by level using BFS method. # Definition for a binary tree node # class TreeNode: # def...
2023-08-01编程代码Binary,leetcode,oj
【LeetCode OJ】Symmetric Tree

Problem Link: https://oj.leetcode.com/problems/symmetric-tree/ To solve the problem, we can traverse the tree level by level. For each level, we construct an array of values of the length 2^depth, ...
2023-08-01编程代码leetcode,oj,tree
【LeetCode OJ】Same Tree

Problem Link: https://oj.leetcode.com/problems/same-tree/ The following recursive version is accepted but the iterative one is not accepted... # Definition for a binary tree node # class TreeNode:...
2023-08-01编程代码leetcode,oj,tree
Leetcode 242.有效的字母异位词(Python3)

题目：给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s =...
2023-08-01编程代码leetcode,字母,异位
Leetcode 242.有效的字母异位词 By Python

给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s = "rat", t = "car&...
2023-08-01编程代码leetcode,字母,异位
min-max容斥学习笔记

min-max容斥学习笔记前置知识二项式反演 \[ f(n)=\sum_{i=0}^n\binom{n}{i}g(i)\Leftrightarrow g(n)=\sum_{i=0}^n(-1)^{n-i}\binom{n}{i}f(i) \] 一些定义 \(\max (S),\min (S)\)表示分别集合\(S\)的最大，最...
2023-07-30编程代码max,min,学习笔记