题目

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:

Return 4.

解法很巧妙，我也是看了discuss，首先列出最左一列和最上面一列，剩下的解法可以看这个

Basic idea is to iterate over all columns and rows of a matrix (starting with i=j=1). If value in a cell>0 and cells to the north, west, and north-west are >0, pick smallest value of those 3 cells, take it's square root, add 1, and assign square of new value to current cell. For example given matrix

1   1   1   1   1   1
1   1   1   0   1   1
1   1   1   1   1   1
1   1   1   1   1   1
1   1   1   1   1   1
1   1   1   1   0   1We get:1   1   1   1   1   1
1   4   4   0   1   4
1   4   9   1   1   4
1   4   9   4   4   4
1   4   9   9   9   9
1   4   9  16   0   1

Our answer is the largest value in new matrix: 16

代码

public class Solution {public int maximalSquare(char[][] matrix) {if(matrix == null || matrix.length == 0) {return 0;}int res = 0;int m = matrix.length;int n = matrix[0].length;int[][] sq = new int[m][n];for(int i = 0; i < m; i++) {if(matrix[i][0] == '1') {sq[i][0] = 1;res = 1;} else {sq[i][0] = 0;}}for(int j = 0; j < n; j++) {if(matrix[0][j] == '1') {sq[0][j] = 1;res = 1;} else {sq[0][j] = 0;}}for(int i = 1; i < m; i++) {for(int j = 1; j < n; j++) {if(matrix[i][j] == '1') {int min = Math.min(Math.min(sq[i][j-1], sq[i-1][j]), sq[i-1][j-1]);//if(min != 0) {sq[i][j] = (int)Math.pow(Math.sqrt(min)+1, 2);res = Math.max(res, sq[i][j]);//}}}}return res;}
}

/********************************

* 本文来自博客 “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/

【LeetCode从零单排】No221.Maximal Square相关推荐

【LeetCode从零单排】No198.House Robber No91.Decode Ways139 word break（动态规划典型应用）
1.题目一道典型的Dynamic Programming的题目. You are a professional robber planning to rob houses along a stree ...
【LeetCode从零单排】No70.ClimbingStairs
题目爬楼梯问题,这是一道很有趣的问题.首先看题目: You are climbing a stair case. It takes n steps to reach to the top. Each ...
【LeetCode从零单排】No26.Remove Duplicates from Sorted Array
题目题目要求:去除sort int数组中的重复项. Given a sorted array, remove the duplicates in place such that each ...
【LeetCode从零单排】No.7 Reverse Integer
前话今天开始励志刷一下leetcode上面的题目(还好这个网站没被TG和谐).从easy的开始,数一下差不多有40道,争取两个月搞定. 题目没想到做的第一道题目,虽然看似 ...
【LeetCode从零单排】No.135Candy(双向动态规划)
1.题目 There are N children standing in a line. Each child is assigned a rating value. You are giving ...
【LeetCode从零单排】No22.Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parent ...
【LeetCode从零单排】No133. clon graph (BFS广度优先搜索)
背景 (以下背景资料转载自:http://www.cnblogs.com/springfor/p/3874591.html?utm_source=tuicool) DFS(Dpeth-first Se ...
【LeetCode从零单排】No121 Best Time to Buy and Sell Stock
题目 Say you have an array for which the ith element is the price of a given stock on day i. If you we ...
【LeetCode从零单排】No96 Unique Binary Search Trees
题目 Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For ex ...

【LeetCode从零单排】No221.Maximal Square

题目

代码

【LeetCode从零单排】No221.Maximal Square相关推荐

最新文章

热门文章