Given a string S, find the length of the longest substring T that contains at most two distinct characters.For example,Given S = “eceba”,T is “ece” which its length is 3. 这道题给我们一个字符串,让我们求最多有两个不同字符的最长子串.那么我们首先想到的是用哈希表来做,哈希表记录每个字符的出现次数,然后如果哈希表中的映射数量超过两
Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Input: "eceba" Output: 3 Explanation: tis "ece" which its length is 3. Example 2: Input: "ccaabbb" Output:
ok,以后最好是每天一个shell小脚本吧,这样以后工作时还可以直接套用,嗯,比较不错,顺便还可以带给刚入门shell的朋友一些帮助,好了,废话不多说,下面是我两种判断的实现方式: 1.通过grep去筛选非数字,判断其输出状态,以下两种方式: #!/bin/bashread -p "please input a num: " num if echo $num | grep -q '[^0-9]' then echo "this is not a num,please inpu
Given a string S, find the length of the longest substring T that contains at most two distinct characters.For example:Given S = “eceba”,T is “ece” which its length is 3. 给定字符串S,找到最长子字符串T的长度,最多包含两个不同的字符. 例如: 给定S = “eceba”, T是“ece” ,长度为3. class Soluti