基于C#的基础练习题(空心金字塔、水仙花数、冒泡排序、杨辉三角)

空心金字塔：

private static void Main(string[] args)
    {
       
       int x = int.Parse(Console.ReadLine());
        for (int i = 0; i < x; i++)
        {
            for (int j = x; j > i; j--)
            {
                Console.Write(' ');
            };
            if (i < x - 1)
            {
                for (int j = 0; j <= 2 * i; j++)
                {
                    if (j == 0 || j == 2 * i)
                        Console.Write('*');
                    else
                        Console.Write(" ");
                };
                Console.Write("\n");
            }
            else
            {
                for (int j = 0; j <= 2 * i; j++)
                {
                    Console.Write('*');
                 };
            }
        }
    }

    private static void Main(string[] args)
    {
        double x = 100000;
        int count = 0;
        while(x > 0)
        {     
            if(x>50000)
            {
                x = 0.95 * x;
            }
            else if(x <= 50000)
            {
                x = x - 1000;
                if (x < 0)
                    break;
            }
            count++;

        }
        Console.WriteLine(count);
    }

 这题唯一注意点就是欠费问题

 

  int x =int.Parse(Console.ReadLine());
        int y = x;
        double count = 0;
        while(x > 0)
        {
            int a = x % 10;
            x /=  10;
            count = count + Math.Pow(a,3) ;
        }
        if (count == y)
            Console.WriteLine("是的");
        else
            Console.WriteLine("不是");

 冒泡法排序：

 private static void Main(string[] args)
    {
        int temp = 0;
        int[] ints = { 24, 69, 80, 57, 13 };
        for (int x = 0; x < ints.Length; x++)
        {
            for (int j = 0, i = 1; i < ints.Length - x; j++, i++)
            {
                if (ints[i] < ints[j])
                {
                    temp = ints[i];
                    ints[i] = ints[j];
                    ints[j] = temp;
                }
            }
        }
       foreach(int i in ints)
        {
            Console.WriteLine(i);
        }
     }

改进： i完全可以用j＋1来表示，然后x可以改成i，省去一个变量。

杨辉三角:

   private static void Main(string[] args)
    { int n = int.Parse(Console.ReadLine());
        int[][] arr = new int[n][];
        for (int i = 0; i < arr.Length; i++)
        {
            arr[i] = new int[i + 1];
            for (int j = 0; j <arr[i].Length; j++)
            {
            
                if(j == 0 || j == arr[i].Length-1)
                {
                    arr[i][j] = 1;
                }
                else
                {
                    arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
                }
            }
        }

        for (int i = 0; i < arr.Length; i++)
        {
            for (int j = 0; j < arr[i].Length; j++)
            {
                Console.Write(arr[i][j] + " ");
            }
            Console.WriteLine(" ");
        }
    }