栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

递归进行更改:如何修改算法以打印所有组合?

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

递归进行更改:如何修改算法以打印所有组合?

我使用了以下内容:

private static int change(List<Integer> coinsUsed, Integer currentCoin, Integer amountSoFar, Integer amountToChange)    {        //if last added coin took us to the correct sum, we have a winner!        if (amountSoFar == amountToChange)        { //output  System.out.print("Change for "+amountToChange+" = "); //run through the list of coins that we have and display each. for(Integer count: coinsUsed){     System.out.print(count + " "); } System.out.println(); //pass this back to be tallied return 1;        }                if (amountSoFar > amountToChange)        { //this branch was unsuccessful return  0;        }        //this holds the sum of the branches that we send below it        int successes=0;        // Pass through each coin to be used        for (Integer coin:coinAmounts)        { //we only want to work on currentCoin and the coins after it if (coin >= currentCoin) {     //copy the list so we can branch from it     List<Integer> copyOfCoinsUsed = new ArrayList<Integer>(coinsUsed);     //add on one of our current coins     copyOfCoinsUsed.add(coin);     //branch and then collect successful attempts     successes += change(copyOfCoinsUsed, coin, amountSoFar + coin, amountToChange); }        }        //pass back the current        return successes;    }


转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/410133.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号