面试算法题
sujia13
这个作者很懒,什么都没留下…
展开
-
Minimum path sum问题
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or ri原创 2016-06-14 18:13:52 · 297 阅读 · 0 评论 -
Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1] ha原创 2016-06-14 18:54:53 · 228 阅读 · 0 评论