c#05数组

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

namespace _05
{
class Program
{
static void Main(string[] args)
{
#region 一维数组
//数组的缺点，有长度限制
//数组保存的信息类型一致
//数据类型【】 数组的名称 =new 数据类型【长度或值】
//int[] ints = new int[5];
//由初始化的值类决定数组的长度
//int[] ints = { 1, 2, 3, 4, 5 };
//ints[0] = 11;
//ints[1] = 22;
//ints[2] = 33;
//ints[3] = 44;
//ints[4] = 55;
//for(int i = 0; i < ints.Length; i++)
//{
// Console.WriteLine(ints[i]);
//}
//foreach(元素数据类型 元素变量名 in 数组/集合名称)
//数组中只用与读
//foreach (int i in ints){
// Console.WriteLine(i);
//}
#endregion

        #region 二维数组
        //int a = 2, b = 3;
        //int[,] ints = new int[a, b];
        ////循环赋值
        //for (int i = 0; i < a; i++)
        //{
        //    for (int y = 0; y < b; y++)
        //    {
        //        ints[i, y] = i + y;
        //    }
        //}
        //foreach (int x in ints)
        //{
        //    Console.WriteLine(x);
        //}
        #endregion

        #region 删除数组元素
        //int[] ints = { 1, 2, 3, 4, 5 };
        //int x = 4;
        //for (int i = x; i < ints.Length; i++)
        //{
        //    if (i == ints.Length - 1)
        //    {
        //        ints[i] = 0;
        //        break;
        //    }
        //    ints[i] = ints[i + 1];
        //}
        //foreach (int y in ints)
        //    Console.WriteLine(y);
        #endregion

        #region 冒泡排序
        //快速排序 红黑树排序 左旋 或者 右旋 二叉树排序
        //int[] ints = { 1, 2, 3, 4, 5 ,7,6};
        //for (int i = 0; i < ints.Length; i++)
        //{
        //    for (int y = 0; y < ints.Length - 1; y++)
        //    {
        //        if (ints[y] < ints[y + 1])
        //        {
        //            int a = ints[y];
        //            ints[y] = ints[y + 1];
        //            ints[y + 1] = a;
        //        }
        //    }
        //}
        //foreach (int x in ints)
        //{
        //    Console.WriteLine(x);
        //}
        #endregion

        #region Array.Sort 从小到大排序
        //int[] ints = { 1, 3, 2, 5, 4 };
        ////Array.Sort(ints)
        ////从小到大 不排序
        //Array.Sort(ints);
        //foreach (int i in ints)
        //{
        //    Console.WriteLine(i);
        //}
        #endregion

        #region 合并数组 多个集合进行合并
        //int[] inti = { 1, 2, 3, 4 };
        //int[] intj = { 1, 2, 3, 4, 5 };
        //int[] intz = new int[inti.Length + intj.Length];
        //int a = 0;
        //foreach (int i in inti)
        //{
        //    intz[a] = i;
        //    a++;
        //}
        //foreach (int i in intj)
        //{
        //    intz[a] = i;
        //    a++;
        //}
        //foreach (int i in intz)
        //{
        //    Console.WriteLine(i);
        //}
        #endregion

        #region 拆分数组
        //int[] intz = { 1, 2, 3, 4, 5, 6 ,7};
        //int[] inti = new int[intz.Length % 2 == 0 ? intz.Length / 2 : intz.Length / 2 + 1];
        //int[] intj = new int[intz.Length / 2];
        //int a = 0;
        //for (int i = 0; i < inti.Length; i++)
        //{
        //    inti[i] = intz[a];
        //    a++;
        //}
        //for (int i = 0; i < intj.Length; i++)
        //{
        //    intj[i] = intz[a];
        //    a++;
        //}
        //foreach (int i in inti)
        //{
        //    Console.WriteLine(i);
        //}
        //foreach (int i in intj)
        //{
        //    Console.WriteLine(i);
        //}
        #endregion

        #region 作业

        //1.定义一个长度为5的字符串数组。循环输入5个姓名。
        //然后再输入一个用户的姓名，
        //检查数组中是否有这个人的姓名，并输出所在下标。

        //string[] s = { "大米","小米","糯米","糙米","白米"};
        //Console.WriteLine("请输入用户名:");
        //string name = Console.ReadLine();
        //for(int i = 0; i < s.Length; i++)
        //{
        //    if (s[i].Equals(name))
        //    {
        //        Console.WriteLine("有"+i);
        //    }
        //}

        //2.定义一个长度为5的整数数组，循环赋值，
        //根据用户输入的位数，进行对应的删除

        //int[] ints = new int[5];
        //for (int i = 0; i < ints.Length; i++)
        //{
        //    ints[i] = i;
        //}
        //Console.WriteLine("请输入您要删除的数组元素的下标");
        //int x = int.Parse(Console.ReadLine());
        //for (int i = x; i < ints.Length; i++)
        //{
        //    if (i == ints.Length - 1)
        //    {
        //        ints[i] = 0;
        //        break;
        //    }
        //    int b = ints[i];
        //    ints[i] = ints[i + 1];
        //    ints[i + 1] = b;
        //}
        //foreach (int i in ints)
        //{
        //    Console.WriteLine(i);
        //}
        //3.定义一个长度为7的字符串数组，并为其赋值，
        //将该数组的值进行反转
        //string[] ss = { "sd", "sdf", "sfd", "sdfdsa", "sdsf", "fdsa", "sdfasdf" };
        //foreach (string s in ss)
        //{
        //    Console.WriteLine(s);
        //}
        //Console.WriteLine("反转后：");
        //Array.Sort(ss);

        //foreach (string s in ss)
        //{
        //    Console.WriteLine(s);
        //}
        //4.99乘法表
        //for (int i = 1; i < 10; i++)
        //{
        //    for (int j = 1; j < i+1; j++)
        //    {
        //        Console.Write(j+"*"+i+"="+j*i+" ");
        //    }
        //    Console.WriteLine();
        //}
        //5.冒泡循环
        //int[] ints = { 1, 2, 5, 3, 4, 6, 9, 7 };
        //foreach (int i in ints)
        //{
        //    Console.WriteLine(i);
        //}
        //Console.WriteLine("冒泡排序后：");
        //for (int i = 0; i < ints.Length; i++)
        //{
        //    for (int y = 0; y < ints.Length - 1; y++)
        //    {
        //        if (ints[y] > ints[y + 1])
        //        {
        //            int x = ints[y];
        //            ints[y] = ints[y + 1];
        //            ints[y + 1] = x;
        //        }
        //    }
        //}
        //foreach (int i in ints)
        //{
        //    Console.WriteLine(i);
        //}
        //Console.ReadLine();
        #endregion
    }
}

}