feat: climbStairs

Author: changchanghwang

climbing-stairs/changchanghwang.go

@@ -0,0 +1,10 @@
+// Time complexity, O(n)
+// Space complexity, O(1)
+// 피보나치 수열로 풀이가 가능하다.
+func climbStairs(n int) int {
+	a, b := 1, 1
+	for ; n > 1; n-- {
+		a, b = b, a+b
+	}
+	return b
+}