题解 | #牛牛的协作#
牛牛的协作
https://www.nowcoder.com/practice/ae483ed148b34e14bec1451b3317984d
import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param s string字符串 * @return int整型 */ public int lengthOfLongestContinuousTasks (String s) { // write code here int res = 0; char[] rec = s.toCharArray(); HashMap<Character, Integer> map = new HashMap<>(); int left = -1; for (int i = 0; i < rec.length; i++) { left = Math.max(map.getOrDefault(rec[i], -1), left); res = Math.max(res, i - left); map.put(rec[i], i); } return res; } }