leetcode 组合总和

最新推荐文章于 2024-03-29 01:13:38 发布

曾经沧海海

最新推荐文章于 2024-03-29 01:13:38 发布

阅读量121

点赞数

分类专栏： leetCode 文章标签：组合总和

本文链接：https://blog.csdn.net/m0_37684037/article/details/106408606

版权

leetCode 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

递归-go：

不能想PHP一样使用全局变量

import (
    "fmt"
    "sort"
)

func combinationSum(candidates []int, target int) [][]int {
    var data []int
    var list [][]int

    sort.Ints(candidates[:])

    _,list = getOne(candidates, target, data, list)

    // for i, candidate := range candidates {
    //
    //     if candidate < target {
    //         data = append(data, candidate)
    //         newTarget := target - candidate
    //         combinationSum(candidates[i:], newTarget)
    //         data = append(data[:len(data)-1])
    //     } else if candidate == target {
    //
    //         d := make([]int, len(data))
    //         copy(d, data)
    //         d = append(d, candidate)
    //
    //         list = append(list, d)
    //
    //     } else {
    //         break
    //     }
    // }
    return list
}

func getOne(candidates []int, target int, data []int, list [][]int) ([]int, [][]int) {

    for i, candidate := range candidates {

        if candidate < target {
            data = append(data, candidate)
            newTarget := target - candidate
            data, list = getOne(candidates[i:], newTarget, data, list)
            data = append(data[:len(data)-1])
        } else if candidate == target {

            d := make([]int, len(data))
            copy(d, data)
            d = append(d, candidate)

            list = append(list, d)

        } else {
            break
        }
    }

    return data, list
}

递归-php：

function combinationSum ($candidates, $target)
    {
        sort($candidates);
        foreach ($candidates as $i => $candidate) {

            // 值小于目标，则递归
            if ($candidate < $target) {
                
                $this->data[] = $candidate;

                $newTarget = $target - $candidate;
                
                // 每次传入子数组
                $this->combinationSum(array_slice($candidates, $i), $newTarget);
                // 递归完成后回到递归前的$data
                array_pop($this->data);

            } elseif ($candidate == $target) {
                
                $this->data[] = $candidate;
               
                $this->list[] = $this->data;
                
                array_pop($this->data);
                
            } else {
                break;
            }
        }
        return $this->list;
    }