合并两个数组并在c#中返回排序数组

Question

---

您将获得一个函数mergeArrays,该函数将2个排序数组作为参数.第一个数组中有M元素,第二个数组也有M元素,但它的容量是2*M.

该函数mergeArrays将两个数组作为参数M.您应该合并第二个数组中的两个数组,以便对结果数组进行排序.

示例TestCase 0:

Input:

1st array: {3,5,6,9,12,14,18,20,25,28}

2nd array: {30,32,34,36,38,40,42,44,46,48 }

Output: {3,5,6,9,12,14,18,20,25,28,30,32,34,36, 38,40,42,44,46,48}

说明:如问题中所述,第二个数组包含足够的空间来容纳第一个数组.返回合并的已排序数组.

Answer 1

解决方案可以是Linq查询:

  int[] first = new int[] { 3, 5, 6, 9, 12, 14, 18, 20, 25, 28 };
  int[] second = new int[] { 30, 32, 34, 36, 38, 40, 42, 44, 46, 48 };

  int[] result = first
    .Concat(second)
    .OrderBy(x => x)
    .ToArray();

去测试

  // 3, 5, 6, 9, 12, 14, 18, 20, 25, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48
  Console.Write(String.Join(", ", result));

它有效,但很难被接受作为家庭作业解决方案.所以我希望你能用我的实现作为测试参考来详细说明你自己的代码.

Answer 2

没有 linq 的解决方案：

int[] array1 = new int[] { 3, 5, 6, 9, 12, 14, 18, 20, 25, 28 };
int[] array2 = new int[] { 30, 32, 34, 36, 38, 40, 42, 44, 46, 48 };

int count1 = array1.Length;
int count2 = array2.Length;
int[] arrayResult = new int[count1 + count2];

int a = 0, b = 0;   // indexes in origin arrays
int i = 0;          // index in result array

// join
while (a < count1 && b < count2)
{
    if (array1[a] <= array2[b])
    {
        // element in first array at current index 'a'
        // is less or equals to element in second array at index 'b'
        arrayResult[i++] = array1[a++];
    }
    else
    {
        arrayResult[i++] = array2[b++];
    }
}

// tail
if (a < count1)
{
    // fill tail from first array
    for (int j = a; j < count1; j++)
    {
        arrayResult[i++] = array1[j];
    }
}
else
{
    // fill tail from second array
    for (int j = b; j < count2; j++)
    {
        arrayResult[i++] = array2[j];
    }
}

// print result
Console.WriteLine("Result is {{ {0} }}", string.Join(",", arrayResult.Select(e => e.ToString())));

结果：

{ 3,5,6,9,12,14,18,20,25,28,30,32,34,36,38,40,42,44,46,48 }

图解说明：