zoukankan      html  css  js  c++  java
  • 字符串string操作

            #region String
            /// <summary>
            /// 首字母大写
            /// </summary>
            /// <param name="str">字符串</param>
            /// <returns>首字母大写</returns>
            public static string ToTitleCase(this string str)
            {
                return Thread.CurrentThread.CurrentCulture.TextInfo.ToTitleCase(str);
            }
    
            /// <summary>
            /// 对字符串进行URL加密
            /// </summary>
            /// <param name="code"></param>
            /// <returns></returns>
            public static string UrlEncode(this string content, string encode = "gb2312")
            {
                return HttpUtility.UrlEncode(content, Encoding.GetEncoding(encode));
            }
    
            /// <summary>
            /// 对字符串进行URL解密
            /// </summary>
            /// <param name="code">加密字符串</param>
            /// <param name="encode">加密编码格式</param>
            /// <returns></returns>
            public static string UrlDecode(this string content, string encode = "gb2312")
            {
                return HttpUtility.UrlDecode(content, Encoding.GetEncoding(encode));
            }
    
            /// <summary>
            /// 获取与正则匹配的第一个项值
            /// </summary>
            /// <param name="remark"></param>
            /// <returns></returns>
            public static string RegexMatch(this string content, string Regex)
            {
                MatchCollection matchs = content.RegexMatches(Regex);
                return matchs.Count > 0 ? matchs[0].Value : "";
            }
            /// <summary>
            /// 获取与正则匹配的第一个项值
            /// </summary>
            /// <param name="remark"></param>
            /// <returns></returns>
            public static MatchCollection RegexMatches(this string content, string Regex)
            {
                Regex reg = new Regex(Regex, RegexOptions.IgnoreCase);
                return reg.Matches(content);
            }
            #endregion
  • 相关阅读:
    leetcode53. Maximum Subarray(动态规划)
    MinGW中没有gdb.exe解决办法
    POJ
    POJ 3614 (贪心)
    bzoj 1057 (悬线法求最大子矩阵)
    bzoj1 218 激光炸弹(二位前缀和)
    POJ 2299(归并求逆序对)
    HDU 1394(归并求逆序对)
    POJ1523 Targin求关节点
    HDU6299 贪心
  • 原文地址:https://www.cnblogs.com/zzgxl/p/10190205.html
Copyright © 2011-2022 走看看