Commit c7049e3

committed

求一个字符串的最大不重复子串

1 parent a67d740 commit c7049e3Copy full SHA for c7049e3

File tree

+31

-1

lines changed

src/main/java/com/algorithm/study/demo
- algorithm
  - Solution.java
- datastructure/linear
  - Solution.java

+31

-1

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,10 @@`
`1`	`1`	`package com.algorithm.study.demo.algorithm;`
`2`	`2`
	`3`	`+import java.util.HashSet;`
	`4`	`+import java.util.LinkedHashSet;`
	`5`	`+import java.util.Set;`
	`6`	`+import java.util.TreeSet;`
	`7`	`+`
`3`	`8`	`/**`
`4`	`9`	`* @Author: liuxun`
`5`	`10`	`* @CreateDate: 2019年2月13日下午3:11`
`@@ -23,4 +28,30 @@ public static int reverse(int x) {`
`23`	`28`	`result = 0;`
`24`	`29`	`return (int)result;`
`25`	`30`	`}`
	`31`	`+`
	`32`	`+ /**`
	`33`	`+ * 求一个字符串的最大不重复子串`
	`34`	`+ */`
	`35`	`+ public static int lengthOfLongestSubstring(String s) {`
	`36`	`+ int n = s.length();`
	`37`	`+ Set<Character> set = new HashSet<>();`
	`38`	`+ int ans = 0, i = 0, j = 0;`
	`39`	`+ while (i < n && j < n) {`
	`40`	`+ // try to extend the range [i, j]`
	`41`	`+ if (!set.contains(s.charAt(j))){`
	`42`	`+ set.add(s.charAt(j++));`
	`43`	`+ ans = Math.max(ans, j - i);`
	`44`	`+ }`
	`45`	`+ else {`
	`46`	`+ //删除重复的字符`
	`47`	`+ set.remove(s.charAt(i++));`
	`48`	`+ }`
	`49`	`+ }`
	`50`	`+ return ans;`
	`51`	`+ }`
	`52`	`+`
	`53`	`+ public static void main(String[] args) {`
	`54`	`+ System.out.println(lengthOfLongestSubstring("abaa"));`
	`55`	`+ }`
	`56`	`+`
`26`	`57`	`}`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,6 @@`
`1`	`1`	`package com.algorithm.study.demo.datastructure.linear;`
`2`	`2`
`3`	`3`	`/**`
`4`		`- * 求一个字符串的最大不重复子串`
`5`	`4`	`* 单链表链表算法题`
`6`	`5`	`* @Author: liuxun`
`7`	`6`	`* @CreateDate: 2019年2月12日下午3:43`

Comments

(0)