三天一题-15-Longest Substring Without Repeating Characters

题目地址：Longest Substring Without Repeating Characters

描述：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.

import java.util.HashSet;
import java.util.Set;

public class WithoutRepeat {
    public static void main(String[] args) {
        String src = "abcdbddc";
        int length=lengthOfLongestSubstring(src);
        System.out.println(length);
    }
    //利用set唯一进行去重
    private static int lengthOfLongestSubstring(String str){
        Set<Character> tem = new HashSet<>();
        for (int i = 0; i <str.length() ; i++) {
            tem.add(str.charAt(i));
        }
       return tem.size();
    }

}