Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public void merge(int[] nums1, int m, int[] nums2, int n) {
- int i = m-1 , j = nums2.length-1, k = nums1.length-1;
- for(; i >= 0 && j >= 0; ){
- if(nums1[i] > nums2[j]){
- nums1[k--] = nums1[i--];
- }
- else
- nums1[k--] = nums2[j--];
- }
- if(i < 0){
- while(j >= 0){
- nums1[k--] = nums2[j--];
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement