Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commita7b1dfb

Browse files
Ildar10nazmeevi
and
nazmeevi
authored
added a solution for 518 coin-change-2 solution (fishercoder1534#162)
Co-authored-by: nazmeevi <ildar.nazmeev@tipico.com>
1 parentf0bfc2f commita7b1dfb

File tree

3 files changed

+45
-1
lines changed

3 files changed

+45
-1
lines changed

‎README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -740,7 +740,8 @@ _If you like this project, please leave me a star._ &#9733;
740740
|523|[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_523.java) | |Medium| DP
741741
|522|[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_522.java)|| Medium|
742742
|521|[Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_521.java)|| Easy|
743-
|520|[Detect Capital](https://leetcode.com/problems/detect-capital/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_520.java)||Easy|
743+
|520|[Detect Capital](https://leetcode.com/problems/detect-capital/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_520.java)||Easy|
744+
|518|[Coin Change 2](https://leetcode.com/problems/coin-change-2/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_518.java) | |Medium| Array, DP
744745
|517|[Super Washing Machines](https://leetcode.com/problems/super-washing-machines/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_517.java) | |Hard| DP
745746
|516|[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_516.java) | |Medium| DP
746747
|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_515.java) | |Medium| BFS
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
packagecom.fishercoder.solutions;
2+
3+
publicclass_518 {
4+
publicstaticclassSolution1 {
5+
publicintchange(intamount,int[]coins) {
6+
int[]ways =newint[amount +1];
7+
ways[0] =1;
8+
for (intdenom :coins) {
9+
for (inti =0;i <ways.length;i++) {
10+
if (denom <=i) {
11+
ways[i] +=ways[i -denom];
12+
}
13+
}
14+
}
15+
returnways[amount];
16+
}
17+
}
18+
}
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
packagecom.fishercoder;
2+
3+
importcom.fishercoder.solutions._518;
4+
importorg.junit.BeforeClass;
5+
importorg.junit.Test;
6+
7+
importstaticjunit.framework.Assert.assertEquals;
8+
9+
publicclass_518Test {
10+
privatestatic_518.Solution1solution1;
11+
12+
@BeforeClass
13+
publicstaticvoidsetup() {
14+
solution1 =new_518.Solution1();
15+
}
16+
17+
@Test
18+
publicvoidtest1() {
19+
intamount =5;
20+
int[]coins =newint[] {1,2,5};
21+
intexpected =4;
22+
intactual =solution1.change(amount,coins);
23+
assertEquals(expected,actual);
24+
}
25+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp