← 返回 meta 的题目列表Maximum Unique Characters Subset
类型：online_judge
Given a string, return the length of the substring with the highest number of unique characters. The solution should have a time complexity of O(n), where n is the length of the string.
Example 1:
Input: 'abcca'
Output: 3
Example 2:
Input: 'aabbcc'
Output: 2
All inputs contain only lowercase English letters, and the maximum length of the string is 100000.
Example
Input
abcabcbb