LeetCode-Easy部分中标签为Two Pointers 88. Merge Sorted Array
2017-04-05 23:08
537 查看
原题
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:
You may assume that nums1 has enough space (size that is greater or equal to
m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
题目分析
归并排序的合并部分,前提是有序数组。题目中说到nums1控件足够大。
代码实现
尤其注意题目给出的Merge的API,nums1足够大,m代表实际元素数,public void Merge(int[] nums1, int m, int[] nums2, int n) { int i = m - 1; //指向nums1 int j = n - 1; //指向nums2 int k = m + n - 1; //指向合并位置 while (j >= 0) { if (i >= 0 && nums1[i] > nums2[i]) nums1[k--] = nums1[i--]; else nums1[k--] = nums2[j--]; } }
更多标签题目
http://blog.csdn.net/daigualu/article/details/69236015相关文章推荐
- LeetCode-Easy部分中标签为Two Pointers的所有题目
- LeetCode-Easy部分中标签为Two Pointers 345. Reverse Vowels of a String
- LeetCode-Easy部分中标签为Two Pointers 125. Valid Palindrome
- LeetCode-Easy部分中标签为LinkedList 160. Intersection of Two Linked Lists
- LeetCode-Easy部分中标签为 Binary Search 349. Intersection of Two Arrays 350. Intersection of Two Arrays II
- LeetCode-Easy部分中标签为HashTable的所有题目
- LeetCode-Easy部分标签为HashTable 409. Longest Palindrome
- LeetCode-Easy部分中标签为String的所有题目
- LeetCode-Easy部分标签为LinkedList 234. Palindrome Linked List
- LeetCode-Easy部分中标签为Array#118: Pascal’s Triangle
- LeetCode-Easy部分标签为LinkedList 83. Remove Duplicates from Sorted List
- LeetCode-Easy部分中标签为Math 231. Power of Two
- LeetCode-Easy部分中标签为LinkedList 21. Merge Two Sorted Lists
- LeetCode-Easy部分中标签为Array#414 : Third Maximum Number
- LeetCode-Easy部分标签为HashTable 447. Number of Boomerangs
- 【leetcode】【Easy】【344. Reverse String】【string】【two pointers】
- LeetCode-Easy部分标签为HashTable#136 Single Number
- LeetCode-Easy部分中标签为Array#35: Search Insert Position
- LeetCode-Easy部分标签为LinkedList 141 Linked List Cycle
- LeetCode-Easy部分中标签为LinkedList 203 Remove Linked List Elements