728x90 codingTest/LeetCode2 [LeetCode] 88. Merge Sorted Array You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a lengt.. 2022. 4. 3. [LeetCode] 83 - Remove Duplicates from Sorted List https://jiwon-jjw.github.io/algorithm/2021/01/13/LeetCode83.html LeetCode 83 - Remove Duplicates from Sorted List | Study Blog 또 한번 반복문이 진행 될 경우, cur = cur.next; 는, null이 되니, 반복문은 종료가 되고 값은 저장이 되어, head를 리턴하면 위와 같은 LinkedList를 얻을 수 있다. jiwon-jjw.github.io [Java] Leetcode 83 - Remove Duplicates from Sorted List 문제 링크 나의 답: /** * Definition for singly-linked list. * public class ListNode { * int v.. 2022. 3. 31. 이전 1 다음 728x90
