程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> 關於C++ >> [LeetCode 221] Maximal Square

[LeetCode 221] Maximal Square

編輯:關於C++

 

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.

 

solution:

DP, f(x,y) represents length of the right-bottom node of square,

ifmatrix[i][j] == 1, f(x,y) = Math.min(f(x-1,y), f(x,y-1),f(x-1,y-1))+1;

 

 

public int maximalSquare(char[][] matrix) {
        int n = matrix.length;
        if(n<=0) return 0;
        int m = matrix[0].length;
        int max = 0;
        int[][] mat = new int[n][m];
        for(int i=0;i

 

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved