找出字符串中最大子串的长度(要求子串中的字符不重复)

给定一个字符串,找出这个字符串中的最大的子串的长度,要求这个子串中的字符不重复。下面贴出的是算法,和测试代码。

算法如下:

public Int32 GetSubCount(String str)
        {
            if (str == null)
            {
                return 0;
            }
            Int32 count = 0;
            Int32 length = count;
            String subStr = String.Empty;
            Boolean searchResult = false;
            for (Int32 item = 0; item <= str.Length-1;item++ )
            {
                searchResult = false;
                foreach (Char c in subStr)
                {
                    if (str[item] == c)
                    {
                        searchResult = true;
                        break;
                    }
                }
                if (searchResult)
                {
                    subStr = subStr.Substring(1, subStr.Length - 1);
                    count--;
                    item--;
                }
                else
                {
                    subStr += str[item].ToString();
                    count++;
                    if (count > length)
                    {
                        length = count;
                    }
                }
            }
            return length;
        }
测试代码:

[TestMethod()]
        public void GetSubCountTest()
        {
            SubString target = new SubString(); // TODO: 初始化为适当的值
            string str = string.Empty; // TODO: 初始化为适当的值
            Assert.AreEqual(0, target.GetSubCount(str));

            str = null;
            Assert.AreEqual(0, target.GetSubCount(str));

            str = "abcbec";
            Assert.AreEqual(3, target.GetSubCount(str));

            str = "abcd";
            Assert.AreEqual(4, target.GetSubCount(str));

            str = "a";
            Assert.AreEqual(1, target.GetSubCount(str));

            str = "aaaaa";
            Assert.AreEqual(1, target.GetSubCount(str));

            str = "abcdb";
            Assert.AreEqual(4, target.GetSubCount(str));

            str = "abcdd";
            Assert.AreEqual(4, target.GetSubCount(str));

            str = "abccc";
            Assert.AreEqual(3, target.GetSubCount(str));

            str = "aabccc";
            Assert.AreEqual(3, target.GetSubCount(str));
        }

转载于:https://www.cnblogs.com/chenping-987123/archive/2010/10/08/1845567.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值