JAVA_Intersection of Two Arrays II_LeetCode 350

JAVA_Intersection of Two Arrays II_LeetCode 350 풀이 class Solution { public int[] intersect(int[] nums1, int[] nums2) { if(nums1.length==0) return nums1; if(nums2.length==0) return nums2; Arrays.sort(nums1); Arrays.sort(nums2); int i=0,j=0,k=0; while(i<nums1.length && j<nums2.length){ if(nums1[i]<nums2[j] ) i++; else if(nums2[j]<nums1[i]) j++; else if(nums1[i]==nums2[j]){ nums1[k++]=nums1[i]; i++; j++; } } return Arrays.copyOfRange(nums1, 0, k); } } * 출처 Level up your coding skills and quickly la...

원문링크 : JAVA_Intersection of Two Arrays II_LeetCode 350