일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- vue.js
- JavaScript
- 변수
- CSS
- 백준
- 프로그래머스
- computed
- SasS
- 코딩테스트
- dynamic programming
- github
- 자료형
- greedy
- java
- sorting
- 파이썬
- JS
- string
- math
- hash table
- HTML
- JavaSceipt
- array
- 자료구조
- scss
- 컴포넌트
- Python
- Algorithm
- leetcode
- 알고리즘
- Today
- Total
목록math (4)
Posis
[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][JavaScript] 1323. Maximum 69 Number 문제 출처: https://leetcode.com/problems/maximum-69-number/ Maximum 69 Number - 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 maximum69Number = function(num) { var str = num.toString(); var res = str.replace('6','9'); retur..
[LeetCode][JavaScript] 66. Plus One 문제 출처: https://leetcode.com/problems/plus-one/ Plus One - 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 plusOne = function(digits) { for (let i = digits.length - 1; i >= 0; i--) { if (digits[i] !== 9) { digits[i]++; return digits;..
[LeetCode][JavaScript] 1025. Divisor Game 문제 출처: https://leetcode.com/problems/divisor-game/ Divisor Game - 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 divisorGame = function (N) { return N % 2 == 0; }; [풀이 방법] 이번 문제는 이해하기가 힘들어 단순하게 예시만 보고 풀었습니다. 혹시나 문제를 이해하시고 다른 ..