双色球 摇奖程序

来源:互联网 发布:网络通信的软件研发 编辑:程序博客网 时间:2024/04/30 03:27

private void button1_Click(object sender, EventArgs e)
        {
            label1.Text = "你选择的红球是:";
            label2.Text = "你选择的篮球是:";
            label3.Text = "预祝你获得500万大奖!!!";
            int[] arrPre = sortArr(generateRandomNumber(1, 32, 6),1);
            foreach (int i in arrPre)
            {
                label1.Text += i.ToString() + " ";
            }
            int[] Lan = generateRandomNumber(1, 16, 1);
            foreach (int j in Lan)
            {
                label2.Text += j.ToString() + " ";
            }
        }
        public static int[] generateRandomNumber(int begin, int end, int size)
        {
            // 加入逻辑判断,确保begin<end并且size不能大于该表示范围
            if (begin >= end || (end - begin) < size)
            {
                return null;
            }
            // 种子你可以随意生成,但不能重复
            int[] seed = new int[end - begin];

            for (int i = begin; i < end; i++)
            {
                seed[i - begin] = i;
            }
            int[] ranArr = new int[size];
            Random ran = new Random();
            // 数量你可以自己定义。
            for (int i = 0; i < size; i++)
            {
                // 得到一个位置
                int j = ran.Next(seed.Length - i);
                // 得到那个位置的数值
                ranArr[i] = seed[j];
                // 将最后一个未用的数字放到这里
                seed[j] = seed[seed.Length - 1 - i];
            }
            return ranArr;
        }
        public int[] sortArr(int[] arr, int xu)
        {
            int i, j, temp;
            if (xu == 1)   //升序排列
            {
                for (i = 0; i < arr.Length; i++)
                {
                    for (j = 0; j < arr.Length - i - 1; j++)
                    {
                        if (arr[j] > arr[j + 1])
                        {
                            temp = arr[j];
                            arr[j] = arr[j + 1];
                            arr[j + 1] = temp;
                        }
                    }
                }

            }
            if (xu == 2)
            {
                for (i = 0; i < arr.Length; i++)
                {
                    for (j = 0; j < arr.Length - i - 1; j++)
                    {
                        if (arr[j] < arr[j + 1])
                        {
                            temp = arr[j];
                            arr[j] = arr[j + 1];
                            arr[j + 1] = temp;
                        }
                    }
                }

            }
            return arr;
        }

原创粉丝点击