算法分析与设计——LeetCode Problem.598 Range Addition II
2018-01-06 23:20
459 查看
问题详情
Given an m * n matrix M initialized with all 0’s and several update operations.Operations are represented by a 2D array, and each operation is represented by an array with two positive integers a and b, which means M[i][j] should be added by one for all 0 <= i < a and 0 <= j < b.
You need to count and return the number of maximum integers in the matrix after performing all the operations.
Example 1:
Input: m = 3, n = 3 operations = [[2,2],[3,3]] Output: 4 Explanation: Initially, M = [[0, 0, 0], [0, 0, 0], [0, 0, 0]] After performing [2,2], M = [[1, 1, 0], [1, 1, 0], [0, 0, 0]] After performing [3,3], M = [[2, 2, 1], [2, 2, 1], [1, 1, 1]] So the maximum integer in M is 2, and there are four of it in M. So return 4.
Note:
The range of m and n is [1,40000].
The range of a is [1,m], and the range of b is [1,n].
The range of operations size won’t exceed 10,000.
问题分析及思路
题意比较简单,一开始我以为可以通过遍历,三层循环,每次每个数加1。然后再将所有的数与在[0][0]的数比较,得到最大的计数。后来发现固定的是[0][0]的数最大,因此只需要求出在所有的operations 数组中对应的最小值,即可得到最小并的行与列数。
具体代码
class Solution { public: int maxCount(int m, int n, vector<vector<int>>& ops) { int min_x = m; int min_y = n; int i; for(i = 0; i < ops.size(); i++) { if(min_x > ops.at(i).at(0)) min_x=ops.at(i).at(0); if(min_y > ops.at(i).at(1)) min_y=ops.at(i).at(1); } return min_x * min_y; } };
相关文章推荐
- 算法分析与设计——LeetCode Problem.213 House Robber II
- [算法分析与设计] leetcode 每周一题: 126. Word Ladder II
- 算法分析与设计课程(5):【leetcode】Search for a Range
- 算法分析与设计——LeetCode Problem.63 Unique Paths II
- 算法分析与设计课程——LeetCode刷题之Search for a Range
- 算法分析与设计课程(19):【leetcode】Ugly Number II
- 算法分析与设计——LeetCode Problem.198 House Robber
- [算法分析与设计] leetcode 每周一题: Word Ladder
- [算法分析与设计] leetcode 每周一题:132 Pattern
- 算法分析与设计——LeetCode Problem.653 Two Sum IV - Input is a BST
- 算法分析与设计课程——LeetCode刷题之Valid Parentheses
- 算法分析与设计——LeetCode:3. Longest Substring Without Repeating Characters
- 算法分析与设计丨第二周丨LeetCode(4)——Maximum Subarray(Easy)
- 算法分析与设计——LeetCode Problem.5 Longest Palindromic Substring
- 算法分析与设计——LeetCode Problem.18 4Sum
- 算法分析与设计——LeetCode Problem.64 Minimum Path Sum
- 算法分析与设计课程——LeetCode刷题之4Sum
- [算法分析与设计] leetcode 每周一题: Kth Smallest Element in a BST
- 算法分析与设计——LeetCode Problem.258 Add Digits
- 算法分析与设计——LeetCode:104. Maximum Depth of Binary Tree