zoukankan      html  css  js  c++  java
  • C#随机生成不重复字符串

    今天整理以前一个项目源码,发现两个随机生成不重复字符串的方法,觉得用起来挺方便的,在此贴出来,方便以后查阅。

            方法一:随机生成不重复数字字符串

           private int rep=0;

           /// <summary>
           /// 生成随机数字字符串
           /// </summary>
           /// <param name="codeCount">待生成的位数</param>
           /// <returns>生成的数字字符串</returns>
           private string GenerateCheckCodeNum(int codeCount)
           {
               string str = string.Empty;
               long num2 = DateTime.Now.Ticks + this.rep;
               this.rep++;
               Random random = new Random(((int)(((ulong)num2) & 0xffffffffL)) | ((int)(num2 >> this.rep)));
               for (int i = 0; i < codeCount; i++)
               {
                   int num = random.Next();
                   str = str + ((char)(0x30 + ((ushort)(num % 10)))).ToString();
               }
               return str;
           }

            方法二:随机生成字符串(数字和字母混和)

           /// <summary>
           /// 生成随机字母字符串(数字字母混和)
           /// </summary>
           /// <param name="codeCount">待生成的位数</param>
           /// <returns>生成的字母字符串</returns>
           private string GenerateCheckCode(int codeCount)
           {
               string str = string.Empty;
               long num2 = DateTime.Now.Ticks + this.rep;
               this.rep++;
               Random random = new Random(((int)(((ulong)num2) & 0xffffffffL)) | ((int)(num2 >> this.rep)));
               for (int i = 0; i < codeCount; i++)
               {
                   char ch;
                   int num = random.Next();
                   if ((num % 2) == 0)
                   {
                       ch = (char)(0x30 + ((ushort)(num % 10)));
                   }
                   else
                   {
                       ch = (char)(0x41 + ((ushort)(num % 0x1a)));
                   }
                   str = str + ch.ToString();
               }
               return str;
           }

  • 相关阅读:
    P1281 书的复制 dp
    P3402 最长公共子序列(nlogn)
    P1201 [USACO1.1]贪婪的送礼者Greedy Gift Givers
    P1202 黑色星期五
    P1205 方块转换
    [递推] hihocoder 1239 Fibonacci
    [二分] hihoCoder 1269 优化延迟
    [分治] POJ 3233 Matrix Power Series
    使用HTMLParser解析html
    CSAPP2e: Proxy lab 解答
  • 原文地址:https://www.cnblogs.com/liufengkui/p/3729995.html
Copyright © 2011-2022 走看看