题解 | #密码验证合格程序#【菜鸟解题】

import java.util.*;


public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextLine()) { // 注意 while 处理多个 case
            int sum = 0;
            boolean isReturn = false;
            String a = in.nextLine();
            char[] arr = a.toCharArray();
            Map<String, Integer> map = new HashMap<>();
		  //1. 判断长度
            if (arr.length < 8) {
                System.out.println("NG");
                isReturn = true;
            }
		  //2. 判断是否满足3种字符要求
            for (int i = 0; i < arr.length; i++) {
                if (arr[i] >= 'a' && arr[i] <= 'z') {
                    if (!map.containsKey("lower")) {
                        map.put("lower", 1);
                        sum++;
                    }
                } else if (arr[i] >= 'A' && arr[i] <= 'Z') {
                    if (!map.containsKey("upper")) {
                        map.put("upper", 1);
                        sum++;
                    }
                } else if (arr[i] >= '0' && arr[i] <= '9') {
                    if (!map.containsKey("number")) {
                        map.put("number", 1);
                        sum++;
                    }
                } else {
                    if (!map.containsKey("other")) {
                        map.put("other", 1);
                        sum++;
                    }
                }
            }
            if (sum < 3) {
                System.out.println("NG");
                isReturn = true ;
            }
		  //3. 循环遍历 重复子串
            int index = 3;
            while (index < arr.length / 2) {
                for (int i = 0; i < (arr.length - index - 1); i++) {
                    String first = a.substring(i, i + index);
                    for (int j = i+1; j < arr.length - index; j++) {
                        if (first.equals(a.substring(j, j + index))) {
                            System.out.println("NG");
                            isReturn = true;
                        }
                    }
                }
                index ++;
            }
            if(!isReturn)
            System.out.println("OK");
        }
    }
}