Commit e73aec0

committed

ADD Min-Cost-Climbing-Stairs problem #57

1 parent afb3cdb commit e73aec0Copy full SHA for e73aec0

File tree

+29

-0

lines changed

+29

-0

lines changed

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,29 @@`
	`1`	`+using System;`
	`2`	`+`
	`3`	`+public class Solution`
	`4`	`+{`
	`5`	`+ public static int MinCostClimbingStairs(int[] cost)`
	`6`	`+ {`
	`7`	`+ if (cost == null \|\| cost.Length < 2)`
	`8`	`+ {`
	`9`	`+ return 0;`
	`10`	`+ }`
	`11`	`+`
	`12`	`+ for (int i = cost.Length - 3; i >= 0; i--)`
	`13`	`+ {`
	`14`	`+ cost[i] += Math.Min(cost[i + 1], cost[i + 2]);`
	`15`	`+ }`
	`16`	`+`
	`17`	`+ return Math.Min(cost[0], cost[1]); // Because I can either start from the step with index 0 or 1.`
	`18`	`+ }`
	`19`	`+`
	`20`	`+ public static void Main(string[] args)`
	`21`	`+ {`
	`22`	`+ int[] cost = { 10, 50 };`
	`23`	`+`
	`24`	`+ Console.WriteLine(MinCostClimbingStairs(cost));`
	`25`	`+`
	`26`	`+ Console.ReadKey();`
	`27`	`+ }`
	`28`	`+}`
	`29`	`+`

Comments

(0)