题解 | #密码强度等级#

import java.util.*;
public class Main {
        private static  int countLower=0;
        private static  int countUpper=0;
        private static  int countDig=0;
        private static int countOther=0;
        public static void main(String[] args){
            Scanner sc = new Scanner(System.in);
            while(sc.hasNext()){
                String str = sc.nextLine();
                int sum=0;
                countLower=0;
                countUpper=0;
                countDig=0;
                countOther=0;
                char[] arr = str.toCharArray();
                if(str.length()<=4){
                    sum+=5;
                }else if(str.length()>=5 &&str.length()<=7){
                    sum+=10;
                }else if(str.length()>=8){
                    sum+=25;
                }
                
                sum+=wordSum(arr);
                //System.out.println(sum);
                sum+=digSum(arr);
                //System.out.println(sum);
                sum+=otherSum(arr);
                //System.out.println(sum);
                sum+=priceSum();
                //System.out.println(sum);
                if(sum>=90){
                     System.out.println("VERY_SECURE");
                }else if(sum<90 && sum>=80){
                     System.out.println("SECURE");
                }else if(sum<80 && sum>=70){
                     System.out.println("VERY_STRONG");
                }else if(sum<70 && sum>=60){
                     System.out.println("STRONG");
                }else if(sum<60 && sum>=50){
                     System.out.println("AVERAGE");
                }else if(sum<50 && sum>=25){
                     System.out.println("WEAK");
                }else if(sum<25 && sum>=0){
                     System.out.println("VERY_WEAK");
                }
            }
        }
        public static int wordSum(char[] arr){
            int count=0;
            int countNo=0;
            for(char c : arr){
                if(c>=97 && c<=122){
                    countLower++;
                }else if(c>=65 && c<=90){
                    countUpper++;
                }else{
                    countNo++;
                }
            }
            if(countNo==arr.length){
                count+=0;
            }else if(countLower>0 && countUpper>0){
                count+=20;
            }else{
                count+=10;
            }
            return count;
        }
        public static int digSum(char[] arr){
            int count = 0;
            for(char c : arr){
                if(c>=48 && c<=57){
                    countDig++;
                }
            }
            if(countDig==0){
                count+=0;
            }else if(countDig ==1){
                count+=10;
            }else{
                count+=20;
            }
            return count;
        }
        public static int otherSum(char[] arr){
            int count = 0;
            for(char c : arr){
                if((c>32&&c<48) || (c>57&&c<65) || (c>90&&c<97) || (c>122&&c<127) ){
                    countOther++;
                }
            }
            if(countOther==0){
                count+=0;
            }else if(countOther ==1){
                count+=10;
            }else{
                count+=25;
            }
            return count;
        }
        public static int priceSum(){
            int count=0;
            if(countLower!=0 && countUpper!=0 && countDig!=0 && countOther!=0){
                count +=5;
            }else if(countLower!=0 || countUpper!=0){
                if(countDig!=0 && countOther!=0){
                    count+=3;
                }else if(countDig!=0){
                    count +=2;
                }
            }
            return count;
        }
}