[leetcode]395. Longest Substring with At Least K Repeating Characters
class Solution {
public int longestSubstring(String s, int k) {
if(s == null||s.length() == 0) return 0;
HashMap<Character, Integer> map = new HashMap<Character, Integer>...
原创
2019-08-07 22:17:17 ·
84 阅读 ·
0 评论