牛客NC232 加起来和为目标值的组合(三)【中等 DFS Java,Go,PHP】

题目

题目链接：
https://www.nowcoder.com/practice/8c297161a58740c5b92b3e184dd1756e

思考

本答案是k数之和为n的通用模版

参考答案Java

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param k int整型
     * @param n int整型
     * @return int整型二维数组
     */
    public int[][] combination (int k, int n) {
        //k个数之和为n的通用模版
        int[] nums = {1, 2, 3, 4, 5, 6, 7, 8, 9};

        List<List<Integer>> list = new ArrayList<>();
        List<Integer> path = new ArrayList<>();
        dfs(nums, 0, 0, path, n, k, list);



        int[][] ans = new int[list.size()][];
        for (int i = 0; i < list.size() ; i++) {
            ans[i] = new int[list.get(i).size()];
            for (int i1 = 0; i1 < list.get(i).size(); i1++) {
                ans[i][i1] = list.get(i).get(i1);
            }
        }
        return ans;
    }

    public void dfs(int[] nums, int i, int sum, List<Integer> path,
                    int n, int k, List<List<Integer>> list) {

        if (path.size() == k) {
            if (sum == n) {
                list.add(new ArrayList<>(path));
            }
        }

        for (int j = i; j < nums.length ; j++) {
            path.add(nums[j]);
            dfs(nums, j + 1, sum + nums[j], path, n, k, list);
            path.remove(path.size() - 1);
        }
    }
}

参考答案Go

package main



/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param k int整型
 * @param n int整型
 * @return int整型二维数组
 */
func combination(k int, n int) [][]int {
	//k个数之和为n的通用模版
	nums := []int{1, 2, 3, 4, 5, 6, 7, 8, 9}
	list := [][]int{}
	path := []int{}

	dfs1(nums, 0, 0, path, n, k, &list)

	//ans := [][]int{}
	//for i := len(list) - 1; i >= 0; i-- {
	//	ans = append(ans, list[i])
	//}

	return list
}

func dfs1(nums []int, i int, sum int, path []int, n int, k int, list *[][]int) {
	if len(path) == k {
		if sum == n {

			t := []int{}
			for x := 0; x < k; x++ {
				t = append(t, path[x])
			}
			*list = append(*list, t)
		}
	}

	for j := i; j < len(nums); j++ {
		path = append(path, nums[j])

		dfs1(nums, j+1, sum+nums[j], path, n, k, list)

		path1 := make([]int, len(path)-1)
		for y := 0; y < len(path)-1; y++ {
			path1[y] = path[y]
		}

		path = path1
	}
}

参考答案PHP

<?php


/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param k int整型 
 * @param n int整型 
 * @return int整型二维数组
 */
function combination( $k ,  $n )
{
       $nums = [1,2,3,4,5,6,7,8,9];
    $list =array();
    $path = array();

    dfs($nums,0,0,$path,$list,$k,$n);

    return $list;
}

function dfs($nums,$i,$sum,$path,&$list,$k,$n){
    if(count($path) == $k){
        if($sum ==$n){
            $t =[];
            foreach ($path as $v){
                array_push($t,$v);
            }
            $list[count($list)] = $t;
        }
    }

    for($j=$i;$j<count($nums);$j++){
        array_push($path,$nums[$j]);
        dfs($nums,$j+1,$sum+$nums[$j],$path,$list,$k,$n);
        array_pop($path);
    }
}