algorithm - 产生给定总和与乘积的子数组

给定一个长度为n的数组。如何找到最小长度
和为S，积为P的连续子数组。
对于eg5 6 1 4 6 2 9 7for S = 17, Ans = [6, 2, 9]for P = 24, Ans = [4 6]。

最佳答案

从左到右，把所有的数字加起来，如果和大于S，就把左边的扔掉。

import java.util.Arrays;

public class test {
    public static void main (String[] args) {
        int[] array = {5, 6, 1, 4, 6, 2, 9, 7};
        int length = array.length;
        int S = 17;
        int sum = 0;                       // current sum of sub array, assume all positive
        int start = 0;                     // current start of sub array
        int minLength = array.length + 1;  // length of minimum sub array found
        int minStart = 0;                  // start of of minimum sub array found
        for (int index = 0; index < length; index++) {
          sum = sum + array[index];
          // Find by add to right
          if (sum == S && index - start + 1 < minLength) {
              minLength = index - start + 1;
              minStart = start;
          }
          while (sum >= S) {
            sum = sum - array[start];
            start++;
            // Find by minus from left
            if (sum == S && index - start + 1 < minLength) {
                minLength = index - start + 1;
                minStart = start;
            }
          }
        }
        // Found
        if (minLength != length + 1) {
            System.out.println(Arrays.toString(Arrays.copyOfRange(array, minStart, minStart + minLength)));
        }
    }
}

以你为例，我认为是或。
积与和没有什么不同，除了计算。