using System.Collections.Generic;
public void Merge(int[] nums1, int m, int[] nums2, int n) {
List<int> resList = new List<int>();
if((nums1.Length == 0 && nums2.Length == 0) || (m == 0 && n == 0))
for(int i = 0; i < m ; i++)
for(int i = 0; i < n; i++)
for(int i = 0; i < resList.Count; i++)
public static void Main()
int[] nums1 = {1,2,3,0,0,0};
Solution sol = new Solution();
sol.Merge(nums1,m,nums2,n);
for(int i = 0; i < nums1.Length; i++)