A1,A2,A3...AN,B1,B2,B3...BN,变为A1,B1,A2,B2,A3,B3.代码,CSharp代码库,德仔网

代码语言

代码分类

【CSharp】 A1,A2,A3...AN,B1,B2,B3...BN,变为A1,B1,A2,B2,A3,B3.

作者:clark-lee / 发布于2014/1/22/ 354

元素为A1,A2,A3...AN,B1,B2,B3...BN,将其变为A1,B1,A2,B2,A3,B3...AN,BN的算法实现

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Chapter2._1
{
  class Program
  {
    static void Main(string[] args)
    {
      while (true)
      {
        //输入数据A={a1,a2,a3...an,b1,b2,b3...bn}
        Console.WriteLine("请输入数组");
        string input = Console.ReadLine();
        string[] strInputs = input.Split(new char[] { ',' }, System.StringSplitOptions.RemoveEmptyEntries);
        int[] inputs;
        try
        {
          inputs = new int[strInputs.Length];
          for (int index = 0; index != strInputs.Length; index++)
          {
            inputs[index] = int.Parse(strInputs[index]);
          }
        }
        //如果没有输入数据，就初始化为 A={1, 3, 5, 7, 9, 2, 4, 6, 8, 10}
        catch (Exception ex)
        {
          inputs = new int[10] { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
        }
        //对数组处理
        ReArrange(ref inputs);
        //输出
        foreach (int i in inputs)
        {
          Console.Write(i);
        }
        Console.WriteLine();
      }
    }
    static void ReArrange(ref int[] an)
    {
      int p = 0, q = an.Length - 1;
      Change(ref an, p, q);
    }
    static void Change(ref int[] an, int p, int q)
    {
      if (p + 1 < q)
      {
        int middle=(p+q)/2;
        //如果n是偶数
        if ((middle+1 - p) % 2 == 0)
        {
          int start = (middle + p + 1) / 2;
          for (int index1 = start, index2 = middle + 1; index1 < middle + 1; index1++, index2++)
          {
            int temp = an[index1];
            an[index1] = an[index2];
            an[index2] = temp;
          }
          Change(ref an, p, middle);
          Change(ref an, middle + 1, q);
        }
          //如果n是奇数
        else
        {
          int start = (middle + p + 1) / 2;
          int val = an[middle];
          for (int index1 = start, index2 = middle+1; index1 < middle+1 ; index1++, index2++)
          {          
           if(index1<middle)
           {
            int temp = an[index1];
            an[index1] = an[index2];
            an[index2-1] = temp;
           }
           else
           {
             an[index2-1]=val;
           }
          }
          Change(ref an, p, middle-1);
          Change(ref an, middle , q);
        }

      }

    }

  }
}

试试其它关键字

同语言下

可能有用的

clark-lee贡献的其它代码(2)