.NET面試常考算法

通過這幾天面試經驗來看，發先如下算法考的概率較大。
所以整理如下，供大家參考！

1.求質數
   質數也成為素數，質數就是這個數除了1和他本身兩個因數以外，沒有其他因數的數，叫做質數，和他相反的是合數，
   就是除了1和他本身兩個因數以外，還友其他因數的數叫做合數。

 namespace ConsoleApp
 {
      class Program
      {
         static void Main(string[] args)
         {
             long i;
             while (true)
             {
                 Console.Write("請輸入要計算的質數（0退出）：");
                 i = long.Parse(Console.ReadLine());
                 if (i == 0) break;
                 DateTime t1 = DateTime.Now;
                 switch (i)
                 {
                     case 1: Console.WriteLine("1 不是質數！"); break;
                     case 2: Console.WriteLine("2 是質數！"); break;
                     default: cal(i); break;
                 }
                 DateTime t2 = DateTime.Now;
                 Console.WriteLine("時間為：{0} 毫秒\n", (t2 - t1).Ticks / 10000f);
             }
         }
 
      //以下為函數部分    
      static void cal(long x)
      {
           long sum = 1;
           byte row = 1;
           Console.Write("\n");
           for (long a = 3; a < x + 1; a++)
           {
              bool flag = true;
               for (long b = 2; b < (a / 2) + 1; b++)
               {
                   if (a % b != 0) continue;
                   flag = false;
                   break;
               }
                if (flag)
                {
                   if (row == 10) { Console.WriteLine(); row = 0; }
                   if (sum == 1) Console.Write("{0,7}", 2);
                   Console.Write("{0,7}", a);
                   sum++; row++;
                }
            }
            Console.WriteLine("\n\n{0} 以內共有 {1} 個質數\n", x, sum);
       }
     }
 }

2.有一列數1，1，2，3，5，........求第30個數.

  public static int Foo(int i)
    {
       if (i <= 0)
            return 0;
       else if (i > 0 && i <= 2)
            return 1;
       else
            return  Foo(i - 1) + Foo(i - 2);
    }
 

 3.冒泡排序

 //冒泡排序類
  public class sorter
  {
        public void Sort(int[] list)
        {
            int i, j, temp;
            bool done = false;
            j = 1;
            while ((j < list.Length) && (!done))
            {
                done = true;
                for (i = 0; i < list.Length - j; i++)
                {
                    if (list[i] > list[i + 1])
                    {
                        done = false;
                        temp = list[i];
                        list[i] = list[i + 1];
                        list[i + 1] = temp;
                    }
                }
                j++;
            }
        }
    }

//調用代碼
 class Program
 {
        static void Main(string[] args)
        {
            int[] arrary = new int[] { 1, 5, 15, 19, 34, 55, 54, 2, 97, 13, 34, 100, 79, 22 };
            sorter sh = new sorter();
            sh.Sort(arrary);
            for (int i = 0; i < arrary.Length; i++)
            {
                Console.Write(arrary[i]);
                Console.Write(",");
            }

            Console.ReadKey();
        }
    }

 4.請編寫一個函數，能夠計算10以內數的階乘，盡量采用遞歸算法。（10!=3628800）。

public int jiecheng(int n)
{
       if (n == 1)
          return 1;
       else if (n == 2)
           return 2;
        else
           return n * jiecheng(n - 1);
}

5 請編程實現此方法。將輸入的整型數組，合並轉換為逗號分隔的字符串。

   例如輸入參數為整型數組{9，7，2}，那么輸出結果為字符串"9,7,2"。 

private static string Combine(int[] data)
  {
      string str = "";
      foreach (int s in data)
      {
           str += s.ToString() + ",";
      }
      return str;
  }

 6.產生一個int數組，長度為100，並向其中隨機插入1-100，並且不能重復。

//產生一個int數組，長度為100，並向其中隨機插入1-100，並且不能重復。
            int[] arr = new int[100];
            ArrayList myList = new ArrayList();
            Random rad = new Random();
            while (myList.Count < 100)
            {
                int num = rad.Next(1, 101);
                if (!myList.Contains(num))
                {
                    myList.Add(num);
                }
            }
            for (int i = 0; i < 100; i++)
            {
                arr[i] = (int)myList[i];
            }
            for (int i = 0; i < arr.Length; i++)
            {
                Console.Write(arr[i] + ",");
            }
            Console.ReadKey();

 7.請將字符串"I am a student"按單詞逆序輸出 如"student a am I"

string S = "I am a student";
char[] C = new char[] { ' '};
string[] n =S.Split(C);
int length = S.Length;
for (int i =length-1 ; i >=0; i--)
{
        Console.Write(n[i]);
        if (i != 0)
        {
            Console.Write(" ");
        }
}

 8.C# 取兩個數組的相同元素

摘要: 以往我們都是肯定絞盡腦汁，肯定什么循環，元素大小，什么因素都考慮進去。但是現在采用Linq可以很好的解決這個問題。找出兩個或多個數組的相同項。代碼如下：

usingSystem;
 usingSystem.Collections.Generic;
 usingSystem.Linq;
 usingSystem.Text;
 namespaceTest4_03
 {
    classProgram
     {
        staticvoidMain(string[] args)
         {
            string[] names = {"Adams","Arthur","Buchanan","Tsbuchis","ShCian","FuchsiaLinda","DecheChen","Lotheer","FindLanciCade",
            "SorchLand","JiangZheng","MisiiLoda","Gtod","Dfac","Lama","BakCades","Losangle","ZheWQ","GehengDahaLothi","ToryLandey",
            "DakaLothy","BthLanda","MenNorth","Fith","FoxMain","DontM","Saobba","Del","Sala","Ghero","BhthLaPhda"};
            IEnumerable<string> skip = names.Skip(10);
            IEnumerable<string> take = names.Take(11);
            //取出兩個序列中交集部分，按理論應該輸出JiangZheng
            IEnumerable<string> intersect = skip.Intersect(take);
            foreach(varsinintersect)
             {
                Console.WriteLine(s);
             }
            Console.ReadKey();
         }
     }
 }