Minimum Subarray 原题链接: http://lintcode.com/zh-cn/problem/minimum-subarray/# Given an array of integers, find the subarray with smallest sum. Return the sum of the subarray. 注意 The subarray should contain at least one integer. 样例 For [1, -1, -2, 1], r…

Given an array of integers, find the subarray with smallest sum. Return the sum of the subarray. Have you met this question in a real interview? Yes Example For [1, -1, -2, 1], return -3 Note The subarray should contain at least one integer. public c…

题目: 最小子数组 给定一个整数数组,找到一个具有最小和的子数组.返回其最小和. 样例 给出数组[1, -1, -2, 1],返回 -3 注意 子数组最少包含一个数字 解题: 和最大子数组 ,差不多的,动态规划的还是可以继续用的 Java程序: public class Solution { /** * @param nums: a list of integers * @return: A integer indicate the sum of minimum subarray */ publ…

Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return -1 instead. Have you met this question in a real interview?     Example Given the array [2,3,1,2,4,…

这道题和max subarray很类似,我用local 和 global 的dp方式阔以解决这道 那么我们来看动态规划的四个要素分别是什么? State: localmin[i] 表示以当前第i个数最为结尾的最小连续子数组和. globalmin[i] 表示以当i个数里面(可以不以第i个作为结尾)的最小连续子数组和. Function: localmin[i] = min(localmin[i - 1] + nums.get(i), nums.get(i)); globalmin[i] = mi…

Given an array of integers, find a contiguous subarray which has the largest sum. Notice The subarray should contain at least one number. Have you met this question in a real interview? Yes Example Given the array [−2,2,−3,4,−1,2,1,−5,3], the contigu…

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. Notice You can only move either down or right at any point in time! Dynamic programming is ultilized…

Given an integer array, find a continuous subarray where the sum of numbers is the biggest. Your code should return the index of the first number and the index of the last number. (If their are duplicate answer, return anyone) Have you met this quest…

Given an integer array, find a continuous rotate subarray where the sum of numbers is the biggest. Your code should return the index of the first number and the index of the last number. (If their are duplicate answer, return anyone. The answer can b…

Given an integer array, adjust each integers so that the difference of every adjcent integers are not greater than a given number target. If the array before adjustment is A, the array after adjustment is B, you should minimize the sum of |A[i]-B[i]|…