如何在数组中找到一个所有值之和为特定值的项？ （C ++和C＃）

Question

Assume that I have an array of integers with a specific size (say 1000)

I want to find the index of an item in this array, given the sum of all items in the array before this item (or including this item).

for example assume that I have the following array:

 int[] values={1,2,3,1,3,6,4,8,2,11}

Input value is 6, then I need to return the index 2 (zero based indexing for 3 in above example) and when given 10, I should return the index 4.

What is the fastest way to do this? in C++ and c#?

Answer 1

If you need to do it only once, then the naive way is also the fastest way: walk the array, and keep the running total. Once you reach the target sum, return the current index.

If you need to run multiple queries for different sums, create an array and set up sums in it, like this:

var sums = new int[values.Length];
sums[0] = values[0];
for (int i = 1 ; i < sums.Length ; i++) {
    sums[i] = sums[i-1] + values[i];
}

If all values are positive, you can run binary search on sums to get to the index in O(log(n)) .

Answer 2

learn BST, it's will the fastest algo for your problem:

http://en.wikipedia.org/wiki/Binary_search_tree