{"id":265,"date":"2022-03-23T18:05:32","date_gmt":"2022-03-23T18:05:32","guid":{"rendered":"http:\/\/www.gislxz.top\/?p=265"},"modified":"2023-03-26T12:45:29","modified_gmt":"2023-03-26T12:45:29","slug":"leetcode322-%e9%9b%b6%e9%92%b1%e5%85%91%e6%8d%a2","status":"publish","type":"post","link":"https:\/\/www.gislxz.com\/index.php\/2022\/03\/23\/leetcode322-%e9%9b%b6%e9%92%b1%e5%85%91%e6%8d%a2\/","title":{"rendered":"Leetcode322 \u96f6\u94b1\u5151\u6362"},"content":{"rendered":"\n

\u96f6\u94b1\u5151\u6362\u662f\u5f88\u7ecf\u5178\u7684\u9898\u76ee\uff0c\u4eca\u5929\u89e3\u9898\u65f6\u5374\u51fa\u73b0\u4e00\u4e9b\u95ee\u9898\uff0c\u8bb0\u5f55\u4e00\u4e0b<\/p>\n\n\n\n

\u9996\u5148\u60f3\u5230\u7684\u662f\u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\uff0c\u7528queue\u5b9e\u73b0<\/p>\n\n\n\n

int coinChange(vector<int>& coins, int amount) {\n        queue<vector<int>> nums;\n        vector<int> passed;\/\/\u8bb0\u5f55\u5df2\u7ecf\u641c\u7d22\u8fc7\u7684\u91d1\u989d\uff0c\u518d\u6b21\u904d\u5386\u5230\u53ef\u76f4\u63a5\u8df3\u8fc7\n        nums.push(vector<int>(coins.size(),0));\/\/\u63d2\u5165\u521d\u59cb\u6570\u91cf\uff0c\u5373\u5168\u662f0\n        int answer=-1;\n        for(;nums.size()>0;){\n            answer++;\n            int queue_num=nums.size();\/\/\u5b58\u50a8\u8fd9\u4e00\u8f6e\u6240\u6709\u7ec4\u5408\u7684size\n            for(int i=0;i<queue_num;i++){\n                int sum=0;\n                vector<int> temp=nums.front();\n\/\/\u53d6\u51fa\u7b2c\u4e00\u4e2a\u6570\u91cf\u7ec4\u5408\n                for(int j=0;j<temp.size();j++){\n                    sum+=coins[j]*temp[j];\/\/\u8ba1\u7b97\u603b\u548c\n                }\n                for(auto k:passed){\/\/\u5982\u679c\u5df2\u7ecf\u641c\u7d22\u8fc7\u8fd9\u4e2asum\u5c31\u8df3\u8fc7\n                    if(k==sum)\n                        goto here;\/\/goto\u8df3\u51fa\u5faa\u73af\uff0c\u67d0\u4e9b\u6559\u6750\u5199\u7740\u4e0d\u8981\u7528goto\uff0c\u5176\u5b9e\u5927\u53ef\u4e0d\u5fc5\u8fd9\u4e48\u7edd\u5bf9\n                }\n                passed.push_back(sum);\/\/\u6ca1\u6709\u641c\u7d22\u8fc7\u8be5sum\u5c31\u63d2\u5165\n                if(sum==amount)\n                    return answer;\n                if(sum<amount){\n                    for(int j=0;j<temp.size();j++){\n                        temp[j]++;\n                        nums.push(temp);\n                        temp[j]--;\/\/\u8bb0\u5f97\u6062\u590d\u539f\u6837\n                    }\n                }\n                here:nums.pop();\/\/\u628a\u961f\u5934\u5f39\u51fa\n            }\n        }\n        return -1;\n    }<\/code><\/pre>\n\n\n\n
\u8fd9\u4e48\u5199\u6267\u884c\u8d77\u6765\u6ca1\u95ee\u9898\uff0c\u8be5\u4f18\u5316\u7684\u4e5f\u4f18\u5316\u4e86\uff0c\u4f46\u63d0\u4ea4\u8fd8\u662f\u8d85\u65f6\uff0c\u540e\u6765\u4e00\u60f3\u8fd8\u662f\u6ca1\u770b\u6e05\u9898\uff0c\u53ea\u8981\u6c42\u8fd4\u56de\u6b21\u6570\uff0c\u5e76\u4e0d\u8981\u6c42\u8fd4\u56de\u5177\u4f53\u7684\u7ec4\u5408\uff0c\u76f8\u5f53\u4e8e\u6211\u4eec\u628a\u9898\u505a\u590d\u6742\u4e86\u3002\u8fd9\u9898\u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\u53ea\u7528\u8bb0\u5f55sum\uff0c\u4e0d\u7528\u8bb0\u5f55\u7ec4\u5408\uff0c\u8fd9\u6837\u5c31\u80fd\u7b80\u5316\u5f88\u591a\u3002<\/p>\n\n\n\n
    int coinChange(vector<int>& coins, int amount) {\n        if(amount == 0) \n            return 0;\n        queue<int> sum;\n        int answer=-1;\n        vector<int> pass;\n        sum.push(0);\n        while(sum.size()>0){\n            answer++;\n            int size0=sum.size();\n            for(int i=0;i<size0;i++){\n                for(auto j:pass){\n                    if(j==sum.front())\n                        goto here;\n                }\n                pass.push_back(sum.front());\n                if(sum.front()==amount)\n                    return answer;\n                else{\n                    for(auto j:coins){\n                        if(sum.front()<=amount-j)\n                            sum.push(sum.front()+j);\n                    }\n                }\n                here:sum.pop();\n            }\n        }\n        return -1;\n    }<\/code><\/pre>\n\n\n\n
\u8fd9\u6837\u5199\u8fd8\u662f\u8d85\u65f6\uff0c\u6362\u6210\u81ea\u9876\u5411\u4e0b\u4e5f\u4e0d\u884c\uff0c\u770b\u6765\u662f\u4f18\u5316\u7684\u65b9\u6cd5\u8349\u7387\u4e86\uff0c\u6362\u505a\u4f7f\u7528\u52a8\u6001\u89c4\u5212\u7684\u601d\u60f3\u5efa\u7acb\u6570\u7ec4\u8bb0\u5f55\u91cd\u590d\u503c\u6765\u8fdb\u4e00\u6b65\u4f18\u5316\u3002<\/p>\n\n\n\n
public:\n    int coinChange(vector<int>& coins, int amount) {\n        pass.resize(amount);\n        return find(coins,amount);\n    }\n    vector<int> pass;\n    int find(vector<int>& coins, int am){\n        if(am==0)\n            return 0;\n        if(am<0)\n            return -1;\n        if(pass[am-1]!=0)\n            return pass[am-1];\n        int min0=INT_MAX;\n        for(auto i:coins){\n            int res=find(coins,am-i);\n            if(res>=0&&res<min0){\n                min0=res+1;\n            }\n        }\n        pass[am-1]=min0==INT_MAX?-1:min0;\n        return(pass[am-1]);\n    }<\/code><\/pre>\n\n\n\n
\u6216\u8005\u76f4\u63a5\u52a8\u6001\u89c4\u5212<\/p>\n\n\n\n
int coinChange(vector<int>& coins, int amount) {\n        int Max = amount + 1;\n        vector<int> dp(amount + 1, Max);\n        dp[0] = 0;\n        for (int i = 1; i <= amount; ++i) {\n            for (int j = 0; j < (int)coins.size(); ++j) {\n                if (coins[j] <= i) {\n                    dp[i] = min(dp[i], dp[i - coins[j]] + 1);\n                }\n            }\n        }\n        return dp[amount] > amount ? -1 : dp[amount];\n    }\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u96f6\u94b1\u5151\u6362\u662f\u5f88\u7ecf\u5178\u7684\u9898\u76ee\uff0c\u4eca\u5929\u89e3\u9898\u65f6\u5374\u51fa\u73b0\u4e00\u4e9b\u95ee\u9898\uff0c\u8bb0\u5f55\u4e00\u4e0b \u9996\u5148\u60f3\u5230\u7684\u662f\u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\uff0c\u7528queue\u5b9e\u73b0 \u8fd9\u4e48\u5199\u6267\u884c\u8d77\u6765\u6ca1\u95ee\u9898\uff0c\u8be5\u4f18 …<\/p>","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[12,6,5,11],"tags":[],"class_list":["post-265","post","type-post","status-publish","format-standard","hentry","category-leetcode","category-6","category-5","category-11"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/posts\/265","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/comments?post=265"}],"version-history":[{"count":2,"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/posts\/265\/revisions"}],"predecessor-version":[{"id":346,"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/posts\/265\/revisions\/346"}],"wp:attachment":[{"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/media?parent=265"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/categories?post=265"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.gislxz.com\/index.php\/wp-json\/wp\/v2\/tags?post=265"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}