- 浏览: 130578 次
文章分类
- 全部博客 (189)
- Tree (14)
- Dynamic Programming (34)
- Array (20)
- Search (1)
- Hash (12)
- Backtracking (22)
- Divide and Conque (8)
- Greedy (6)
- Stack (12)
- software (0)
- List (7)
- Math (22)
- Two pointers (16)
- String (20)
- Linux (1)
- Sliding Window (4)
- Finite State Machine (1)
- Breadth-first Search (7)
- Graph (4)
- DFS (6)
- BFS (3)
- Sort (9)
- 基础概念 (2)
- 沟通表达 (0)
- Heap (2)
- Binary Search (15)
- 小结 (1)
- Bit Manipulation (8)
- Union Find (4)
- Topological Sort (1)
- PriorityQueue (1)
- Design Pattern (1)
- Design (1)
- Iterator (1)
- Queue (1)
最新评论
-
likesky3:
看了数据结构书得知并不是迭代和递归的区别,yb君的写法的效果是 ...
Leetcode - Graph Valid Tree -
likesky3:
迭代和递归的区别吧~
Leetcode - Graph Valid Tree -
qb_2008:
还有一种find写法:int find(int p) { i ...
Leetcode - Graph Valid Tree -
qb_2008:
要看懂这些技巧的代码确实比较困难。我是这么看懂的:1. 明白这 ...
Leetcode - Single Num II -
qb_2008:
public int singleNumber2(int[] ...
Leetcode - Single Num II
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.
For example, given the following matrix:
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Return 4.
[分析]
思路1:修改MaxRectangle的实现,求解每一行上最大矩形面积改为求解最大正方形面积。
思路2:dp[i][j]表示以(i, j)为右下角顶点的正方形的边长,则(i, j)处为1时dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]) + 1
For example, given the following matrix:
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Return 4.
[分析]
思路1:修改MaxRectangle的实现,求解每一行上最大矩形面积改为求解最大正方形面积。
思路2:dp[i][j]表示以(i, j)为右下角顶点的正方形的边长,则(i, j)处为1时dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]) + 1
public class Solution { // Method 2: http://blog.csdn.net/xudli/article/details/46371673 public int maximalSquare(char[][] matrix) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return 0; int rows = matrix.length, cols = matrix[0].length; int max = 0; int[][] dp = new int[rows][cols]; for (int i = 0; i < rows; i++) { dp[i][0] = matrix[i][0] == '1' ? 1 : 0; max = Math.max(max, dp[i][0]); } for (int j = 0; j < cols; j++) { dp[0][j] = matrix[0][j] == '1' ? 1 : 0; max = Math.max(max, dp[0][j]); } for (int i = 1; i < rows; i++) { for (int j = 1; j < cols; j++) { if (matrix[i][j] == '1') { dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1; max = Math.max(max, dp[i][j]); } } } return max * max; } // Method 1: extension of maximalRectangle public int maximalSquare1(char[][] matrix) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return 0; int rows = matrix.length, cols = matrix[0].length; int[] h = new int[cols + 1]; int max = 0; for (int i = 0; i < rows; i++) { for (int j = 0; j < cols; j++) { if (matrix[i][j] == '1') h[j] += 1; else h[j] = 0; } max = Math.max(max, getMaxSquare(h)); } return max; } public int getMaxSquare(int[] h) { LinkedList<Integer> stack = new LinkedList<Integer>(); int max = 0; for (int i = 0; i < h.length; i++) { while (!stack.isEmpty() && h[i] < h[stack.peek()]) { int currH = h[stack.pop()]; while (!stack.isEmpty() && h[stack.peek()] == currH) stack.pop(); int len = Math.min(i - (stack.isEmpty() ? -1 : stack.peek()) - 1, currH); max = Math.max(max, len * len); } stack.push(i); } return max; } }
发表评论
-
Leetcode - Ugly Number II
2015-08-24 22:54 1119[分析] 暴力的办法就是从1开始检查每个数是否是丑数,发现丑数 ... -
Leetcode - Paint House II
2015-08-20 20:37 1572There are a row of n houses, ea ... -
Leetcode - Paint House
2015-08-16 10:48 1114There are a row of n houses, ea ... -
Leetcode - Different Ways to Add Parentheses
2015-07-29 20:21 1153Given a string of numbers and o ... -
Jump Game II
2015-07-05 16:49 501Given an array of non-negative ... -
Leetcode - Jump Game
2015-07-05 15:52 488Given an array of non-negative ... -
Leetcode - Interleaving String
2015-06-07 11:41 566Given s1, s2, s3, find whe ... -
Leetcode - Wildcard Matching
2015-06-06 20:01 951Implement wildcard pattern ma ... -
Leetcode - Maximal Square
2015-06-04 08:25 588Given a 2D binary matrix fille ... -
Leetcode - Palindrome Partition II
2015-05-21 21:15 638Given a string s, partition ... -
Leetcode - Palindrome Partition
2015-05-21 09:56 748Given a string s, partition s s ... -
Leetcode - House Robber II
2015-05-20 22:34 730Note: This is an extension of ... -
Leetcode - Maximum Rectangle
2015-05-20 08:58 463Given a 2D binary matrix fill ... -
Leetcode - Scramble String
2015-05-17 14:22 541Given a string s1, we may repre ... -
Leetcode - Regular Expression Matching
2015-05-16 16:31 386Implement regular expression ma ... -
Leetcode - Distinct Subsequences
2015-05-01 16:56 463Given a string S and a string T ... -
Leetcode - Best Time to Buy and Sell Stock IV
2015-05-01 16:11 578Say you have an array for which ... -
Leetcode - Best Time to Buy and Sell Stock IV
2015-04-23 09:59 0public class Solution ... -
Leetcode - Best Time to Buy and Sell Stock III
2015-04-23 09:04 445Say you have an array for whi ... -
Leetcode - Dungeon Game
2015-04-21 09:50 414The demons had captured the pr ...
相关推荐
《leetcode-solutions》,刷算法题,需要有一定的英文阅读能力。。。
Algorithm-LeetCode-Sol-Res.zip,干净,易懂的解决方案和资源,为leetcode在线判断算法问题。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
IDEA 插件,lettcode刷题,leetcode-editor7.4版本下载进行本地导入(直接将压缩包拖进IDEA即可)
Algorithm-leetcode-spider.zip,leetcode公司,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
在IDE中解决LeetCode问题,支持leetcode.com与leetcode-cn.com,满足基本的做题需求。 理论上支持: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio。
leetcode-cli-plugins leetcode-cli 的第 3 方插件。 什么是 如何使用 如何使用 插件 名称 描述 增强的命令 按公司或标签过滤问题 list 不要在同一台计算机上使 Chrome 的会话过期 login 不要在同一台计算机上使 ...
解题思路思路和LeetCode-python 503.下一个更大元素 II一致,只是这里求的是下标的距离,而不是数值倒序搜索,用到栈,栈里存储索引情况1:若栈为
leetcode-cheat 的发布 它是什么 ? 这是一个chrome 扩展,可以帮助您更高效地使用 leetcode。您可以从 重要: leetcode-cheat 现在只支持中文版。 也就是说不完全支持leetcode.com,但是你可以用leetcode-cn.com代替...
leetcode 答案解析 golang解答
leetcode-editor,在ide中做leetcode练习,支持leetcode.com和leetcode-cn.com,以满足练习的基本需求。理论上支持:intellij idea phpstorm webstorm pycharm rubymine appcode clion goland datagrip rider mps ...
~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/vsc-leetcode-cli/bin/leetcode /usr/local/bin/leetcode 修改模板 open ~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/...
leetcode-helper-1.7.1
leetcode-tag-dynamic programming
然后进入到LeetCode-Spider目录中修改config.json,其中outputDir需要填写该工程的/docs/views文件夹路径 { "username": "aaa", "password": "bbb", "outputDir": "/Users/liuyao/Downloads/LeetCode-Blog-Test/docs...
leetcode-cli 注意:这个存储库是为了临时使用而分叉的。 注意:从 webbrowser 复制 cookie 并使用leetcode user -c可以临时修复不能。 一个享受 leetcode 的高效 cli 工具! 非常感谢 leetcode.com,一个非常棒的...
leetcode-tag-Tree
leetcode-tag-Stack
leetcode-tag-array
Algorithm-LeetCode-Solution-From-GuaZiDou.zip,Leetcode解决方案Gitbook,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。