tag:blogger.com,1999:blog-1402726418106920478.post4227256492730009166..comments2023-12-08T00:37:43.430-08:00Comments on Baozi Training Blog (包子IT面试培训博客): Leetcode solution 1292: Maximum Side Length of a Square with Sum Less than or Equal to ThresholdBaozi Bloggerhttp://www.blogger.com/profile/07289751810673778475noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-1402726418106920478.post-84164386492501670682020-03-08T11:25:35.074-07:002020-03-08T11:25:35.074-07:00Thanks. It was very helpful. Your diagrams really ...Thanks. It was very helpful. Your diagrams really helped in understanding. I've a little doubt. In that Brute Force Solution, why are returning len+1 instead of len?<br /><br />> Thank you for your reply and that's a good catch. You can think of Len as the delta distance, as a matter of fact, I would probably rename length as delta, and star the for loop with <br /> for (int len = Math.min(row, col) ; len >= 1; len--) -> for (int len = Math.min(row, col) - 1; len >= 1; len--) Anonymousnoreply@blogger.com