Notice
Recent Posts
Recent Comments
Link
250x250
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | |||
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 26 | 27 | 28 | 29 | 30 | 31 |
Tags
- 변수
- 알고리즘
- array
- 컴포넌트
- dynamic programming
- JavaScript
- math
- HTML
- string
- CSS
- greedy
- 자료형
- 프로그래머스
- 백준
- github
- Python
- 파이썬
- 자료구조
- hash table
- Algorithm
- 코딩테스트
- scss
- vue.js
- leetcode
- JS
- java
- computed
- SasS
- sorting
- JavaSceipt
Archives
- Today
- Total
목록memoization (1)
Posis
[LeetCode][JavaScript] 70. Climbing Stairs
[LeetCode][JavaScript] 70. Climbing Stairs 문제 출처: https://leetcode.com/problems/climbing-stairs/ Climbing Stairs - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com [직접 푼 코드] var climbStairs = function (n) { if (n < 3) return n; let first = 1; let second = 2; for (let i = 3; i
알고리즘/leetcode
2021. 7. 29. 14:45