Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit ff47501

Browse filesBrowse files
committed
Add Java solution2 dynamic programming for day21: Count Square Submatrices with All Ones
1 parent b11f9f8 commit ff47501
Copy full SHA for ff47501

File tree

Expand file treeCollapse file tree

1 file changed

+1
-1
lines changed
Filter options
Expand file treeCollapse file tree

1 file changed

+1
-1
lines changed

‎May-LeetCoding-Challenge/21-Count-Square-Submatrices-With-All-Ones/Count-Square-Submatrices-With-All-Ones.java

Copy file name to clipboardExpand all lines: May-LeetCoding-Challenge/21-Count-Square-Submatrices-With-All-Ones/Count-Square-Submatrices-With-All-Ones.java
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ private boolean isSquare(int[][] square, int xfrom, int xto, int yfrom, int yto)
2727
}
2828

2929
/**
30-
* Dynamique programmingsolution
30+
* Dynamic programmingsolution
3131
* Runtime: 5 ms
3232
* Memory Usage: 49 MB
3333
* Time complexity: O(m*n)

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.