php递归算法的简单示例,PHP 如何递归算法？

dp方案

dp, 只用一维数组节省内存, 但是题目复杂度太大... 不玩了.

public Set> compute(int N, int SUM, int MAX_KEY) {

Set>[] pre = null;

Set>[] cur = new Set[SUM + 1];

// one elem

for (int i = 0; i <= MAX_KEY; i++) {

cur[i] = new HashSet<>();

cur[i].add(Collections.singletonList(i));

}

for (int i = 2; i <= N; i++) {

pre = cur;

cur = new Set[SUM + 1];

for (int j = 0; j <= SUM; j++)

for (int k = 0; k <= MAX_KEY; k++)

if (j - k >= 0 && pre[j - k] != null) {

if (cur[j] == null)

cur[j] = new HashSet<>();

for (List l: pre[j - k]) {

List tmp = new ArrayList<>(l);

tmp.add(k);

Collections.sort(tmp);

cur[j].add(tmp);

}

}

}

return cur[SUM];

}

@Test

public void test(){

compute(30, 12865, 999);

}

dp方案2

二维数组, 太费内存

private Set>[][] dp = null;

private Set> res = null;

public Set> compute(int N, int SUM, int MAX_KEY) {

dp = new Set[N + 1][SUM + 1];

for (int i = 0; i <= MAX_KEY; i++) {

dp[1][i] = new HashSet<>();

dp[1][i].add(Collections.singletonList(i));

}

for (int i = 2; i <= N; i++)

for (int j = 0; j <= SUM; j++)

for (int k = 0; k <= MAX_KEY; k++)

if (j - k >= 0 && dp[i - 1][j - k] != null) {

if (dp[i][j] == null)

dp[i][j] = new HashSet<>();

for (List l: dp[i - 1][j - k]) {

List tmp = new ArrayList<>(l);

tmp.add(k);

dp[i][j].add(tmp);

}

}

return dp[N][SUM];

}

递归方案

Java代码. 用了一些优化提高效率, 但复杂度还是太高. 权当参考吧.

private Set failedSet = null;

private Set> res = null;

public Set> compute() {

failedSet = new HashSet<>();

res = new HashSet<>();

computeInt(30, 12865, 999, new int[30]);

return res;

}

private boolean computeInt(int count, int sum, int max, int[] arr) {

if (count == 0 || sum < 0) {

if (sum == 0){

List tmp = Arrays.stream(arr).sorted().boxed()

.collect(Collectors.toList());

res.add(tmp);

}

return sum == 0;

}

long key = (long)count * Integer.MAX_VALUE + sum;

if (failedSet.contains(key))

return false;

boolean found = false;

for (int i = 0; i <= max; i++) {

arr[count - 1] = i;

if (computeInt(count - 1, sum - i, Math.min(max, i), arr))

found = true;

}

if (!found)

failedSet.add(key);

return found;

}