88.Merge Sorted Array
来源：互联网 发布：浙江软件学院 编辑：程序博客网 时间：2024/05/19 13:20
题目链接：merge-sorted-array
import java.util.Arrays;/** * * Given two sorted integer arrays A and B, merge B into A as one sorted array. * * Note: * You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. * The number of elements initialized in A and B are m and n respectively. * */public class MergeSortedArray { static void merge(int A[], int m, int B[], int n) { int p = m - 1, q = n - 1; int count = m + n - 1; while(p >= 0 && q >= 0) { A[count--] = (A[p] < B[q]) ? B[q--] : A[p--]; } while(q >= 0) A[count--] = B[q--]; // System.out.println(Arrays.toString(A)); }public static void main(String[] args) {merge(new int[]{1, 2 ,3, 4, 5, 0, 0, 0, 0 ,0}, 2, new int[]{6, 7, 8, 9, 10}, 5);}} 0 0
- 88. Merge Sorted Array
- 88.Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- UVa 12627 - Erratic Expansion
- C++ Public, Private和 Protected 继承
- 腾讯百度一次面试题和经历
- 追逐自己的梦想----------辅助制作第十八课：拖拽技能到快捷栏
- SQL语句手册
- 88.Merge Sorted Array
- 解开密码
- Event Manager and Event Listener
- vijos1114
- Ubuntu下将终端快捷加入右键方法
- html5学习渐阶笔记---基础知识略解
- java学习之匿名内部类与包装类
- C++ pair的用法
- SIFT特征提取分析
