3. Longest Substring Without Repeating Characters

旧城等待， 2023-06-01 12:55 13阅读 0赞

package LeetCode_3
    
    import java.lang.StringBuilder
    
    /**
     * 3. Longest Substring Without Repeating Characters
     * https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
     *
     * Given a string, find the length of the longest substring without repeating characters.
    
    Example 1:
    Input: "abcabcbb"
    Output: 3
    Explanation: The answer is "abc", with the length of 3.
    
    Example 2:
    Input: "bbbbb"
    Output: 1
    Explanation: The answer is "b", with the length of 1.
    
    Example 3:
    Input: "pwwkew"
    Output: 3
    Explanation: The answer is "wke", with the length of 3.
    Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
     * */
    class Solution {
        fun lengthOfLongestSubstring(s: String): Int {
            var result = 0
            val length = s.length
            for (i in 0 until length) {
                val sb = StringBuilder()
                var subI = i
                while (subI < length) {
                    if (sb.toString().indexOf(s[subI]) == -1) {
                        //if not found the char in substring, add it up
                        sb.append(s[subI])
                    } else {
                        break
                    }
                    subI++
                }
                result = Math.max(result, sb.toString().length)
            }
            return result
        }
    }

转载于:https://www.cnblogs.com/johnnyzhao/p/11546547.html

发表评论取消回复

表情：

评论列表（有 0 条评论，13人围观）

还没有评论，来说两句吧...

相关阅读

相关 3. Longest Substring Without Repeating Characters

package LeetCode_3 import java.lang.StringBuilder / 3. Longe

旧城等待，/ 2023年06月01日 12:55/ 0 赞/ 14 阅读

相关 Longest Substring Without Repeating Characters

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

- 日理万妓/ 2022年08月20日 05:09/ 0 赞/ 15 阅读

相关 Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters Given a string, find the length of the

快来打我*/ 2022年08月06日 10:18/ 0 赞/ 126 阅读

相关 LeetCode3—Longest Substring Without Repeating Characters

本类型博客中的各算法的时间复杂度分析均为博主自己推算，本类型博客也是博主自己刷LeetCode的自己的一些总结，因此个中错误可能较多，非常欢迎各位大神在博客下方评论，请不吝赐教

刺骨的言语ヽ痛彻心扉/ 2022年06月09日 07:38/ 0 赞/ 156 阅读

相关 Longest Substring Without Repeating Characters

题目 Given a string, find the length of the longest substring without repeating char

短命女/ 2022年06月08日 11:46/ 0 赞/ 189 阅读

相关 Longest Substring Without Repeating Characters

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

冷不防/ 2022年06月08日 08:13/ 0 赞/ 124 阅读

相关 3. Longest Substring Without Repeating Characters

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

分手后的思念是犯贱/ 2022年03月22日 08:14/ 0 赞/ 131 阅读

相关 Leetcode 3. Longest Substring Without Repeating Characters

https://leetcode.com/problems/longest-substring-without-repeating-characters/ Given a s

超、凢脫俗/ 2021年12月22日 00:55/ 0 赞/ 184 阅读

相关 Longest Substring Without Repeating Characters

题意为给出一个字符串，找出其中没有重复字符的最长子序列的长度。brute force的复杂度为O(n^3).依次查找每个子字符串是否含有重复字符，并比较长度。开始看到题目，想用

淡淡的烟草味﹌/ 2021年12月17日 10:27/ 0 赞/ 140 阅读

相关 Leetcode3 Longest Substring Without Repeating Characters

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

阳光穿透心脏的1/2处/ 2021年10月14日 04:58/ 0 赞/ 237 阅读