Leetcode 88 Merge Sorted Array
来源:互联网 发布:php mysql 一键安装 编辑:程序博客网 时间:2024/05/08 04:37
Given two sorted integer arrays nums1 andnums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal tom + n) to hold additional elements from nums2. The number of elements initialized innums1 and nums2 are m and n respectively.
题目链接:https://leetcode.com/problems/merge-sorted-array/
题目大意:将两个有序数组nums1和nums2合并到nums1中,保证nums1的空间足够
题目分析:将nums1的值向后移n位,为了防止越界从最后一位向前移,然后两个指针比较并移动即可
public class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { for(int i = m - 1; i >= 0; i--) { nums1[i + n] = nums1[i]; } int ptr1 = n, ptr2 = 0, ptr = 0; while(ptr1 < m + n && ptr2 < n) { if(nums1[ptr1] < nums2[ptr2]) { nums1[ptr ++] = nums1[ptr1 ++]; } else { nums1[ptr ++] = nums2[ptr2 ++]; } } while(ptr1 < m + n) { nums1[ptr ++] = nums1[ptr1 ++]; } while(ptr2 < n) { nums1[ptr ++] = nums2[ptr2 ++]; } }}
0 0
- LeetCode(88) Merge Sorted Array
- [leetcode 88] Merge Sorted Array
- LeetCode[88]Merge Sorted Array
- leetcode-88 Merge Sorted Array
- leetcode || 88、Merge Sorted Array
- LeetCode---(88)Merge Sorted Array
- Leetcode[88]-Merge Sorted Array
- leetcode 88 Merge Sorted Array
- leetcode[88]:Merge Sorted Array
- Leetcode #88 Merge Sorted Array
- leetcode 88: Merge Sorted Array
- leetcode: (88) Merge Sorted Array
- [Leetcode]#88 Merge Sorted Array
- 【LeetCode 88 】 Merge Sorted Array
- [leetcode 88]Merge Sorted Array
- leetcode 88:Merge Sorted Array
- 【LeetCode】88 Merge Sorted Array
- LeetCode 88:Merge Sorted Array
- linux之pktgen用法学习
- 20160815Block块一
- 关于UPnP Device Architecture 2.0的阅读笔记(十一)
- 最大流EK
- jquery 选择器 处理radio 单选问题
- Leetcode 88 Merge Sorted Array
- Allegro PCB Editor 中如何快速放置元件
- 关于消息队列的使用----ActiveMQ,RabbitMQ,ZeroMQ,Kafka,MetaMQ,RocketMQ
- npm cnpm
- 【66】机器人的运动范围
- Damem Nike CR7 nike mercurial vortex
- OttoVSEventBus
- 左偏树
- 出现 warning: Insecure world writable dir /usr/local/bin in PATH, mode 040777