清晰！遍历一遍获取长度最大值+正则匹配判断，时间复杂度O(n) import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { String string = sc.nextLine(); doSearch(string); } } public static void doSearch(String string){ int n = 0,maxOne = 0;//计...
