Your are given an array of positive integers nums. Count and print the number of contiguous subarrays where the product of all the elements in the subarray is less than k. Example : Note: lt nums.len ...
2017-10-30 12:32 8 5418 推荐指数：
题目：Maximum Product Subarray 这道题属于动态规划的题型，之前常见的是Maximum SubArray，现在是Product Subarray，不过思想是一致的。当然不用动态规划，常规方法也是可以做的，但是时间复杂度过高（TimeOut），像下面这种形式 ...
Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Note ...
Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example ...
Return the length of the shortest, non-empty, contiguous subarray of `A` with sum at least `K`. If there is no non-empty subarray with sum at least ...
Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K. Example 1: Note: 1 < ...
Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example ...
原题链接在这里：https://leetcode.com/problems/two-sum-less-than-k/ 题目： Given an array A of integers and integer K, return the maximum S ...
Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0 instead. Example ...
