Merge Sorted Array LeetCode Java (

[@Premchand-ko9fm]

👍

[@sanjaychaharnaturevlogs7077]

Runtime error

[@sanjaychaharnaturevlogs7077]

Error in code

[@poonamshinhapoonamshinha2795]

Error code

[@teju2213]

when u submmit then there is different code

[@EngineeringDigest]

check 9:00

[@shoumomondal7850]

@@EngineeringDigest class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int r1 = m - 1; int r2 = nums2.length - 1; int w = m + n - 1; while (w >= 0) { if (r1 >= 0 && r2 >= 0) { nums1[w] = nums1[r1] > nums2[r2] ? nums1[r1--] : nums2[r2--]; } else if (r1 >= 0) { nums1[w] = nums1[r1--]; } else { nums1[w] = nums2[r2--]; } w--; } } }