Skip to content

Commit 02ebbb1

Browse files
Merge branch 'neetcode-gh:main' into main
2 parents e8dcc45 + dfef0bc commit 02ebbb1

File tree

2 files changed

+10
-1
lines changed

2 files changed

+10
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -388,7 +388,7 @@ If you would like to have collaborator permissions on the repo to merge your own
388388
<sub>Problem</sub> | <sub>C</sub> | <sub>C++</sub> | <sub>C#</sub> | <sub>Dart</sub> | <sub>GO</sub> | <sub>Java</sub> | <sub>JS</sub> | <sub>Kotlin</sub> | <sub>Python</sub> | <sub>Ruby</sub> | <sub>Rust</sub> | <sub>Scala</sub> | <sub>Swift</sub> | <sub>TS</sub>
389389
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
390390
<sub>[0070 - Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)</sub> | <sub><div align='center'>[✔️](c%2F0070-climbing-stairs.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0070-climbing-stairs.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0070-climbing-stairs.cs)</div></sub> | <sub><div align='center'>[✔️](dart%2F0070-climbing-stairs.dart)</div></sub> | <sub><div align='center'>[✔️](go%2F0070-climbing-stairs.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0070-climbing-stairs.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0070-climbing-stairs.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0070-climbing-stairs.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0070-climbing-stairs.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0070-climbing-stairs.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0070-climbing-stairs.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0070-climbing-stairs.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0070-climbing-stairs.ts)</div></sub>
391-
<sub>[0746 - Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)</sub> | <sub><div align='center'>[✔️](c%2F0746-min-cost-climbing-stairs.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0746-min-cost-climbing-stairs.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0746-min-cost-climbing-stairs.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0746-min-cost-climbing-stairs.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0746-min-cost-climbing-stairs.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0746-min-cost-climbing-stairs.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0746-min-cost-climbing-stairs.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0746-min-cost-climbing-stairs.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0746-min-cost-climbing-stairs.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0746-min-cost-climbing-stairs.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0746-min-cost-climbing-stairs.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0746-min-cost-climbing-stairs.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0746-min-cost-climbing-stairs.ts)</div></sub>
391+
<sub>[0746 - Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)</sub> | <sub><div align='center'>[✔️](c%2F0746-min-cost-climbing-stairs.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0746-min-cost-climbing-stairs.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0746-min-cost-climbing-stairs.cs)</div></sub> | <sub><div align='center'>[✔️](dart%2F0746-min-cost-climbing-stairs.dart)</div></sub> | <sub><div align='center'>[✔️](go%2F0746-min-cost-climbing-stairs.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0746-min-cost-climbing-stairs.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0746-min-cost-climbing-stairs.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0746-min-cost-climbing-stairs.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0746-min-cost-climbing-stairs.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0746-min-cost-climbing-stairs.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0746-min-cost-climbing-stairs.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0746-min-cost-climbing-stairs.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0746-min-cost-climbing-stairs.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0746-min-cost-climbing-stairs.ts)</div></sub>
392392
<sub>[0198 - House Robber](https://leetcode.com/problems/house-robber/)</sub> | <sub><div align='center'>[✔️](c%2F0198-house-robber.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0198-house-robber.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0198-house-robber.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0198-house-robber.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0198-house-robber.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0198-house-robber.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0198-house-robber.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0198-house-robber.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0198-house-robber.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0198-house-robber.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0198-house-robber.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0198-house-robber.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0198-house-robber.ts)</div></sub>
393393
<sub>[0213 - House Robber II](https://leetcode.com/problems/house-robber-ii/)</sub> | <sub><div align='center'>[✔️](c%2F0213-house-robber-ii.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0213-house-robber-ii.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0213-house-robber-ii.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0213-house-robber-ii.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0213-house-robber-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0213-house-robber-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0213-house-robber-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0213-house-robber-ii.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0213-house-robber-ii.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0213-house-robber-ii.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0213-house-robber-ii.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0213-house-robber-ii.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0213-house-robber-ii.ts)</div></sub>
394394
<sub>[0005 - Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)</sub> | <sub><div align='center'>[✔️](c%2F0005-longest-palindromic-substring.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0005-longest-palindromic-substring.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0005-longest-palindromic-substring.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0005-Longest-Palindromic-Substring.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0005-longest-palindromic-substring.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0005-longest-palindromic-substring.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0005-longest-palindromic-substring.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0005-longest-palindromic-substring.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0005-longest-palindromic-substring.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0005-longest-palindromic-substring.ts)</div></sub>
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
class Solution {
2+
int minCostClimbingStairs(List<int> cost) {
3+
for (int i = cost.length - 3; i >= 0; i--) {
4+
cost[i] += min(cost[i + 1], cost[i + 2]);
5+
}
6+
7+
return min(cost[0], cost[1]);
8+
}
9+
}

0 commit comments

Comments
 (0)