IT/leetcode3 [leetcode] 88. Merge Sorted Array in-place로 작성해야하니 컬렉션을 복재해서 코딩하면 안됨. 변환값이 없기도 하고... Time Complexity: O(m+n)Space Complexity: O(1) The function uses a fixed amount of extra space regardless of the input size. Only a few integer variables are used for index tracking, so the space complexity is /** Do not return anything, modify nums1 in-place instead. */function merge(nums1: number[], m: number, nums2: number[], n: number): void.. 2024. 6. 30. [leetcode] 83. Remove Duplicates from Sorted List Time Complexity: O(n) where n is the number of nodes in the linked list.Space Complexity: O(1) as we use constant amount of space for variables. function deleteDuplicates(head: ListNode | null): ListNode | null { let current = head while(current) { if(current.val === current?.next?.val) { current.next = current?.next?.next } else { current = current.ne.. 2024. 6. 29. [leetcode] Climbing Stairs 아래의 솔루션을 보고 학습했습니다. https://leetcode.com/problems/climbing-stairs/solutions/4211515/0ms-very-easy-beginner-friendly-code-faster-all-three-approaches solution 1Time Complex: O(n)Space Complex: O(n) function climbStairs(n: number): number { if (n solution 2 (using tabulation)Time Complex: O(n)Space Complex: O(n)function climbStairs(n: number): number { const tab: number[] = new Array(n + 1).f.. 2024. 6. 23. 이전 1 다음