问题链接:
LeetCode 88 — Merge Sorted Array
AC代码:
public class Problem88 {
public static void main(String[] args) {
// TODO Auto-generated method stub
}
//参考 https://discuss.leetcode.com/topic/10257/3-line-java-solution/3
public void merge(int[] nums1, int m, int[] nums2, int n) {
while(n>0)nums1[m+n-1]=(m==0||nums2[n-1]>nums1[m-1])?nums2[--n]:nums1[--m];
}
}