728x90
๋ฐ์ํ
[LeetCode - Daily Challenge] 70. Climbing Stairs
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps Example 2: Input: n = 3 Output: 3 Explanation: There are three ways to climb to th..
Algorithm/LeetCode Daily Challenge
2021. 10. 6. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,526
- Today
- 22
- Yesterday
- 397
๋งํฌ
TAG
- r
- spring boot jwt
- JPA
- gRPC
- ๋๋ฉ์ธ ์ค๊ณ
- ์๊ณ ๋ฆฌ์ฆ
- leetcode
- QueryDSL
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Boot
- ์คํ๋ง๋ถํธ
- intellij
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- leetcode bst
- Java
- Jackson
- ์คํ๋ง ๋ถํธ jwt
- leetcode binary search
- leetcode stack
- spring boot application
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- proto3
- Linux
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- Spring Data JPA
- spring boot app
- Spring Boot Tutorial
- JSON