JAVA_Merge Sorted Array_LeetCode 88

JAVA_Merge Sorted Array_LeetCode 88 Merge Sorted Array 풀이 class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int i = m-1; int j = n-1; int k = m+n-1; while(i>=0 && j>=0){ nums1[k--] = nums1[i] < nums2[j] ? nums2[j--] : nums1[i--]; } while(j>=0){ nums1[k--] = nums2[j--]; } } } * 출처 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...

원문링크 : JAVA_Merge Sorted Array_LeetCode 88