Leetcode刷题记——3. Longest Substring Without Repeating Characters

一、题目叙述：

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 subsequence and not a substring.

二、解题思路：

哎呦，我有个疑问？Leetcode上到底会不会超时呀？为什么我做这道题，完全算是暴力，为什么还通过了？奇怪！好啦，抽空重新换个复杂度低点的算法。目前这个算法就是暴力一个一个比较，得到最长字串长度，并没有什么思路可言。。。

三、源源源码（复杂度超高）：

public class Solution { public int lengthOfLongestSubstring(String s) { int max = 1; int flag = 1; char[] a = s.toCharArray(); int N = a.length; int i,j; if (s.equals("") || s.equals(null)) return 0; for (int fir = 0; fir < N-1; fir++) { for (i = fir + 1; i < N && flag != 0; i++) for (j = fir; j < i; j++) { if (a[i] == a[j]) { flag = 0; i --; break; } } if ((i-fir) > max) max = i - fir; flag = 1; } return max; } public static void main(String args[]) { String a = "abcda"; Solution so = new Solution(); System.out.println(so.lengthOfLongestSubstring(a)); } }