/// <summary>
/// 建立包含原數(shù)組內(nèi)所有元素且元素間互不重復(fù)的新數(shù)組
/// </summary>
/// <param name="array">原數(shù)組</param>
/// <param name="isAsc">true:升序排列/false:降序排列</param>
/// <returns>新數(shù)組</returns>
private static int[] DifferentElements(int[] array, bool isAsc = true)
{
 //0.輸入合法性校驗(yàn)
 if (array == null || array.Length == 0)
 {
  return new int[] { };
 }
 //1.臨時(shí)數(shù)組：與原數(shù)組元素一樣
 int[] tempArray = new int[array.Length];
 for (int i = 0; i < tempArray.Length; i++)
 {
  tempArray[i] = array[i];
 }
 //2.對(duì)臨時(shí)數(shù)組進(jìn)行排序
 int temp;
 for (int i = 0; i < tempArray.Length; i++)
 {
  for (int j = i; j < tempArray.Length; j++)
  {
   if (isAsc)
   {
    if (tempArray[i] > tempArray[j])
    {
     temp = tempArray[i];
     tempArray[i] = tempArray[j];
     tempArray[j] = temp;
    }
   }
   else
   {
    if (tempArray[i] < tempArray[j])
    {
     temp = tempArray[i];
     tempArray[i] = tempArray[j];
     tempArray[j] = temp;
    }
   }
  }
 }
 //3.統(tǒng)計(jì)臨時(shí)數(shù)組共有多少個(gè)不同的數(shù)字
 int counter = 1;
 for (int i = 1; i < tempArray.Length; i++)
 {
  if (tempArray[i] != tempArray[i - 1])
  {
   counter++;
  }
 }
 //4.建立結(jié)果集數(shù)組
 int[] result = new int[counter];
 int count = 0;
 result[count] = tempArray[0];
 for (int i = 1; i < tempArray.Length; i++)
 {
  if (tempArray[i] != tempArray[i - 1])
  {
   count++;
   result[count] = tempArray[i];
  }
 }
 //5.返回結(jié)果集
 return result;
}

static void Main(string[] args)
{
 int[] array = new int[]
 {
  1, 9, 1, 9, 7, 2, 2, 5, 3, 4,
  5, 6, 3, 3, 6, 2, 6, 7, 8, 0
 };
 //數(shù)組：包含原數(shù)組內(nèi)全部元素且不重復(fù)（升序排列）
 int[] result1 = DifferentElements(array);
 foreach (int i in result1)
 {
  Console.Write(i.ToString() + "\t");
 }
 //數(shù)組：包含原數(shù)組內(nèi)全部元素且不重復(fù)（降序排列）
 int[] result2 = DifferentElements(array,false);
 foreach (int i in result2)
 {
  Console.Write(i.ToString() + "\t");
 }
 Console.ReadLine();
}