mmm305658979的博客

1.找到数组中重复数字（字符），返回出现频次最多 字典方法，时间复杂度O(N) +O(1) def maxf(x): a = dict() max = 0 for i in x: tem = str(i) a[tem] = a.get(tem,0) + 1 if max < a[tem]:...

[LeetCode] 3. Longest Substring Without Repeating Characters 最长无重复字符的子串 Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" O...