Leetcode c语言-Longest Substring Without Repeating Characters

最新推荐文章于 2019-11-22 17:51:29 发布

hahachenchen789

最新推荐文章于 2019-11-22 17:51:29 发布

阅读量600

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode c语言 Leecode c语言

本文链接：https://blog.youkuaiyun.com/hahachenchen789/article/details/77913999

Leetcode c语言同时被 2 个专栏收录

39 篇文章

订阅专栏

Leecode c语言

39 篇文章

订阅专栏

本文介绍了一种从给定字符串中找出最长无重复字符子串的算法，并提供了C语言实现代码。通过实例展示了如何计算不同输入下最长无重复子串的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Title:

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequenceand not a substring.

题目是从一个字符串中找到最长的没有重复字符的子字符串。这道题目比较简单，就不多说解题思路，直接贴上c代码：

Solutions:

int lengthOfLongestSubstring(char* s) {
    int len = 0;
    int length = 1;
    int last_length = 1;
    int i;
    
    while (s[len]) {
        if (len >= 1) {
           for (i = len - length; i <= len -1; i++) {
               if (s[len] == s[i]) {
                   if (last_length < length)
                        last_length = length;
                                  
                   length = len -i;
                   break;
               }
               else if (i == len -1) {
                   length++;
                   if (last_length < length)
                        last_length = length;
               }
           } 
        }
        len++;
    }
    
    if (len == 0)
        return len;
    
    return last_length;

}