VR引擎开发0105

任意输入对应瓶数的可乐，输出对应喝了多少瓶，剩下几个空瓶

        int CoCal = 364;
        int Botal = 0;
        for (int i = 0; ; i++)
        {
            int num1 = CoCal % 3;
            int num2 = CoCal / 3;
            CoCal = num1 + num2;
            Botal += num2;

            if (num2 == 0)
            {
                Console.WriteLine(CoCal);
                Console.WriteLine(Botal * 3 + CoCal);

                break;
            }
}

字符串加密

            char[] charList  = Console.ReadLine().ToCharArray();
            //将数组通过某个字符连接成字符串 string.Join(连接符，数组)最后返回一个字符串 ，和Split相反
            string[] stList = { "1", "2", "3", "4", "5" };
            Console.WriteLine(string.Join("-", stList));
        for (int i = 0; i < charList.Length; i++)
        {
            if (('a' <= charList[i] && charList[i] <= 'z') || ('A' <= charList[i] && charList[i] <= 'z')) { 

                if ('x' <= charList[i] || 'X' <= charList[i] && charList[i]<='z')
                {
                    charList[i] = Convert.ToChar(charList[i] - 23);
                }
                else
                {
                    charList[i]=(char)(charList[i]+3); //强转
                }
            }
        }
        Console.WriteLine(string.Join("", charList));

冒泡排序

        int[] num = { 17, 3, 4, 5, 1, 9 };

        for(int i = 0; i < num.Length-1; i++)
        {
            for (int j = 0; j < num.Length-1-i; j++)
            {
                //定一个中间值temp
                int temp = num[j];
                if (num[j] > num[j+1])
                {
                    num[j] = num[j + 1];
                    num[j+1] = temp;
                }
            
            }

        }
        Console.WriteLine(String.Join(" ", num));

数组自带的排序功能

        int[] aray1 = {9,3,4,2,62,25};
        Array.Sort(aray1);  //会改变原来的数组
        Console.WriteLine(string.Join(" ", aray1));

       //插入数组
        int[] aray2 = { 32, 15, 67, 48, 3 };
        Console.WriteLine("请输入你要插入的数"); 
        int x = Convert.ToInt32(Console.ReadLine());
        int m = 0; //定义一个变量来判断x插入的位置

        Array.Sort(aray2);
        for (int i = 0; i < aray2.Length-1; i++)
        {
            //用x和里面的值进行比较 找出对应的下标位置 
            if (aray2[i] <= x && x <= aray2[i+1])
            {
                m= i+1;
                break;
            }
        }
        //如果没有执行上面的if语句，循环结束，下标位置还是0，所以只要判断最后的位置

    
        //判断特殊情况 最后一个数
        if (x>= aray2[aray2.Length-1])
        {
            m = aray2.Length;
        }
        int[] array2 = new int[aray2.Length+1];
        //上面执行后，就得到了要插入的下标位置，下面创建一个新的数组
        for (int i = 0; i < m; i++)
        {
            array2[i] = aray2[i];
        }
        //直接插入x的值
        array2[m]=x;
        for (int i = m+1; i < array2.Length; i++)
        {
            array2[i] = aray2[i - 1];
        }
        for (int i = 0; i < array2.Length; i++)
        {
            Console.Write(array2[i] +" ");
        }