IncredibleThings

导航

2018年12月2日 #

Google - Largest Sum Submatrix

摘要: Given an NxN matrix of positive and negative integers, write code to find the submatrix with the largest possible sum. // "static void main" must be defined in a public class. public class Main { ... 阅读全文

posted @ 2018-12-02 11:34 IncredibleThings 阅读(192) 评论(0) 推荐(0) 编辑

LeetCode - Maximum Subarray

摘要: algorithm that operates on arrays: it starts at the left end (element A[1]) and scans through to the right end (element A[n]), keeping track of the ma 阅读全文

posted @ 2018-12-02 10:53 IncredibleThings 阅读(104) 评论(0) 推荐(0) 编辑

LeetCode - Unique Paths II

摘要: A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2018-12-02 02:15 IncredibleThings 阅读(159) 评论(0) 推荐(0) 编辑

LeetCode - Unique Paths

摘要: A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2018-12-02 00:34 IncredibleThings 阅读(128) 评论(0) 推荐(0) 编辑