5. Given two sorted integer lists nums1 and nums2, merge nums2 into nums1 as one sorted array. The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2. Example 1: Input: List nums =Arrays.asList(1,2,3,0,0,0); int m = 3; List nums =Arrays.asList(2,5,6); int n=3; Output: [1,2,2,3,5,6] Example 2: Input: List nums =Arrays.asList(1); int m = 1; List nums =Arrays.asList(); int n=0; Output: [1]

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
icon
Concept explainers
Question

Please help with the following in JAVA

 

5. Given two sorted integer lists nums1 and nums2, merge nums 2 into nums1 as one sorted
array. The number of elements initialized in nums1 and nums2 are m and n respectively. You
may assume that nums1 has a size equal to m + n such that it has enough space to hold
additional elements from nums2.
Example 1:
Input:
List<Integer> nums =Arrays.asList (1,2,3,0,0,0);
int m = 3;
List<Integer> nums =Arrays.asList (2,5,6);
int n=3;
Output: [1,2,2,3,5,6]
Example 2:
Input:
List<Integer> nums =Arrays.asList (1);
int m = 1;
List<Integer> nums =Arrays.asList ();
int n=0;
Output: [1]
Transcribed Image Text:5. Given two sorted integer lists nums1 and nums2, merge nums 2 into nums1 as one sorted array. The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2. Example 1: Input: List<Integer> nums =Arrays.asList (1,2,3,0,0,0); int m = 3; List<Integer> nums =Arrays.asList (2,5,6); int n=3; Output: [1,2,2,3,5,6] Example 2: Input: List<Integer> nums =Arrays.asList (1); int m = 1; List<Integer> nums =Arrays.asList (); int n=0; Output: [1]
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Types of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education