{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2021-04-01--005","result":{"data":{"site":{"siteMetadata":{"title":"Blog by Eunyoung","subtitle":"작업 기록 블로그","copyright":"© All rights reserved.","author":{"name":"EunYoung","twitter":"#"},"disqusShortname":"","url":"https://ssongey.github.io"}},"markdownRemark":{"id":"6793858c-0b8b-51c1-8d48-0ff554fd34ce","html":"

#. 테스트 문제

\n

\n \n \n \n \n \n \n \n \n \n

\n
\n

#. 결과 및 풀이

\n

1. 풀이

\n
@Test\nvoid CoinChange() {\n    Assertions.assertEquals(3, CoinChange_Solution(new int[]{1,2,5}, 11));\n}\n\nprivate int CoinChange_Solution(int[] coins, int amount) {\n    \n    //1.\n    int max = amount + 1;\n    int[] dp = new int[max];\n    Arrays.fill(dp, max);\n    dp[0] = 0;\n    \n    //2.\n    for (int i=0; i<=amount; i++) {\n        for(int j=0; j<coins.length; j++) {\n            if(i >= coins[j]) {\n                dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1);\n            }\n        }\n    }\n    return dp[amount] > amount ? -1 : dp[amount];\n}
\n
\n

배웠다

","fields":{"tagSlugs":["/tags/dp/"],"slug":"/algo/posts/2021-04-01--005"},"frontmatter":{"title":"[참고] Coin Change","tags":["DP"],"date":"2021-04-01","description":"값이 나올 수 있는 동전 최소 개수"}}},"pageContext":{"slug":"/algo/posts/2021-04-01--005"}},"staticQueryHashes":[]}