php 1-33个数字_选6个数加起来等于114_有多少组这样的数,javascript - 算法：给一个数字，求有多少种方法相加等于这个数？...

代言2017-06-28 09:27:292楼

这种算法逻辑最好有一定的限定条件，我姑且认为有指定数量的元数字和目标数字。

Java版本：

import java.util.ArrayList;

import java.util.Arrays;

class SumSet {

static void sum_up_recursive(ArrayList numbers, int target, ArrayList partial) {

int s = 0;

for (int x: partial) s += x;

if (s == target)

System.out.println("sum("+Arrays.toString(partial.toArray())+")="+target);

if (s >= target)

return;

for(int i=0;i

ArrayList remaining = new ArrayList();

int n = numbers.get(i);

for (int j=i+1; j

ArrayList partial_rec = new ArrayList(partial);

partial_rec.add(n);

sum_up_recursive(remaining,target,partial_rec);

}

}

static void sum_up(ArrayList numbers, int target) {

sum_up_recursive(numbers,target,new ArrayList());

}

public static void main(String args[]) {

Integer[] numbers = {3,9,8,4,5,7,10};

int target = 15;

sum_up(new ArrayList(Arrays.asList(numbers)),target);

}

}

C#版本：

public static void Main(string[] args)

{

List numbers = new List() { 3, 9, 8, 4, 5, 7, 10 };

int target = 15;

sum_up(numbers, target);

}

private static void sum_up(List numbers, int target)

{

sum_up_recursive(numbers, target, new List());

}

private static void sum_up_recursive(List numbers, int target, List partial)

{

int s = 0;

foreach (int x in partial) s += x;

if (s == target)

Console.WriteLine("sum(" + string.Join(",", partial.ToArray()) + ")=" + target);

if (s >= target)

return;

for (int i = 0; i < numbers.Count; i++)

{

List remaining = new List();

int n = numbers[i];

for (int j = i + 1; j < numbers.Count; j++) remaining.Add(numbers[j]);

List partial_rec = new List(partial);

partial_rec.Add(n);

sum_up_recursive(remaining, target, partial_rec);

}

}

Ruby版本：

def subset_sum(numbers, target, partial=[])

s = partial.inject 0, :+

# check if the partial sum is equals to target

puts "sum(#{partial})=#{target}" if s == target

return if s >= target

(0..(numbers.length - 1)).each do |i|

n = numbers[i]

remaining = numbers.drop(i+1)

subset_sum(remaining, target, partial + [n])

end

end

subset_sum([3,9,8,4,5,7,10],15)

Python版本：

def subset_sum(numbers, target, partial=[]):

s = sum(partial)

# check if the partial sum is equals to target

if s == target:

print "sum(%s)=%s" % (partial, target)

if s >= target:

return

for i in range(len(numbers)):

n = numbers[i]

remaining = numbers[i+1:]

subset_sum(remaining, target, partial + [n])

if __name__ == "__main__":

subset_sum([3,9,8,4,5,7,10],15)

#输出:

#sum([3, 8, 4])=15

#sum([3, 5, 7])=15

#sum([8, 7])=15

#sum([5, 10])=15

如果给定条件是正数的话，把数组换成1~N。这个逻辑同样适用负数。