LeetCode算法题

最新推荐文章于 2023-11-09 08:28:37 发布

AlbenXie

最新推荐文章于 2023-11-09 08:28:37 发布

阅读量275

点赞数

分类专栏：算法面试

本文链接：https://blog.csdn.net/albenxie/article/details/104965237

版权

面试同时被 2 个专栏收录

700 篇文章 8 订阅

订阅专栏

算法

32 篇文章 0 订阅

订阅专栏

package com.example.demo.leetcode;

import org.apache.commons.lang3.StringUtils;

import java.util.HashMap;
import java.util.HashSet;

/**
 * @Description Longest Substring Without Repeating Characters
 * eg:
 * Given "abcabcbb", the answer is "abc", which the length is 3
 *
 * time:o(n)
 * space:o(n)
 * @Auther gf.x
 * @Date 2020/2/26 18:02
 */
public class LongestSubstringWithoutRepeatingCharacters {
    public int LongestSubstringWithoutRepeatingCharacters(String s) {
        if (StringUtils.isEmpty(s)) {
            return 0;
        }

        HashMap<Character, Integer> map = new HashMap<>();
        int res = 0;
        for (int i = 0, j = 0; i < s.length(); i++) {
            if (map.containsKey(s.charAt(i))) {
                j = Math.max(j, map.get(s.charAt(i)) + i);
            }
            map.put(s.charAt(i), i);
            res = Math.max(res, i - j + 1);
        }
        return res;
    }

    public int LongestSubstringWithoutRepeatingCharacters2(String s) {
        if (StringUtils.isEmpty(s)) {
            return 0;
        }

        HashSet<Character> set = new HashSet<>();
        int res = 0;
        for (int i = 0; i < s.length(); i++) {
            if (set.contains(s.charAt(i))) {
                set.remove(s.charAt(i));
            } else {
                set.add(s.charAt(i));
                res = Math.max(res, set.size());
            }
        }
        return res;
    }
}