bloomin

[LeetCode/C++]FirstBadVersion _ binary search

https://leetcode.com/problems/first-bad-version/ 풀다가 어딘가 꼬여버린 알고리즘... // The API isBadVersion is defined for you. // bool isBadVersion(int version); class Solution { public: int firstBadVersion(int n) { bool nums[n+1]; nums[0] = 0; for(int i=1;i

[LeetCode/python]4. Median of Two Sorted Arrays

https://leetcode.com/problems/median-of-two-sorted-arrays/ class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: arr = nums1+nums2 arr.sort() mid = 0 if len(arr)%2==0 : first = (len(arr)-1)//2 second = (len(arr)-1)//2+1 mid = (arr[first]+arr[second])/2 else: mid = arr[len(arr)//2] return mid 뭔가 너무 어렵게 푼 기분이라 다시 풀어봤다. class Solution: def findMedianSortedAr..

[LeetCode/python]Climbing Stairs/ dp

https://leetcode.com/problems/climbing-stairs/ class Solution: def climbStairs(self, n: int) -> int: dp = [j for j in range(n+1)] for i in range(3, n+1): dp[i] = dp[i-1] + dp[i-2] return dp[n] Bottom-up 방식으로 설계 피보나치 문제와 비슷함

[LeetCode]N-th Tribonacci Number/ DP문제

https://leetcode.com/problems/n-th-tribonacci-number/ class Solution: def tribonacci(self, n: int) -> int: dp = [j for j in range(n+1)] ans = 0 for i in range(2, n+1): dp[i] = dp[i-1] + dp[i-2] T = dp for j in range(3, n+1): T[j] = T[j-3]+T[j-2]+T[j-1] return T[n] 피보나치를 구해서 메모해놓고, 그걸 이용해서 N-th Tribonacci를 구하는 문제.