给出两个有序数组,使两数组合并为一个新数组依然有序

class Program
    {
        static void Main(string[] args)
        {
            int[] a = {0,6,8,10 };
            int[] b = {1,2,3 };
            int[] c = new int[a.Length + b.Length];
            int i = 0, j = 0;int k = 0;
            //遍历完一个数组即可跳出循环,同时数组为空则不能进入循环
            while (i<a.Length&&j<b.Length)
            {              
                if (a[i] <= b[j])
                {
                    c[k] = a[i];
                    i++;
                }
                else
                {
                    c[k] = b[j];
                    j++;
                }
                k++;
            }
           //由于上面的循环结束后必定有一个数组全部遍历,所以下面的两个循环只会执行一个
            while (i < a.Length)
            {
                c[k++] = a[i++];               
            }
            while (j < b.Length)
            {
                c[k++] = b[j++];             
            }
            foreach(int v in c)
            {
                Console.WriteLine(v);
            }
        }
    }

猜你喜欢

转载自blog.csdn.net/m0_37640877/article/details/124643109