题解 | #密码强度等级#

密码强度等级

http://www.nowcoder.com/practice/52d382c2a7164767bca2064c1c9d5361

什么叫!!他马的!!屎山!!!!!

import java.util.*;
import java.util.regex.*;
public class Main{
    
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        while(scan.hasNext()){
            String str = scan.nextLine();
            char[] ch = str.toCharArray();
            getScore(getLength(ch)+haveNum(ch)+haveWord(ch)+haveOther(ch)+award(ch));
            
        }
        scan.close();
    }
    
    public static int getLength(char[] ch){
        if(ch.length<=4){
            return 5;
        }
        else if(ch.length>=8){
            return 25;
        }
        else{
            return 10;
        }
    }
    
    public static int haveNum(char[] ch){
        int count = 0;
        for(char c : ch){
            if(String.valueOf(c).matches("[0-9]")){
                count++;
            }
        }
        if(count == 0){
            return 0;
        }
        else if(count == 1){
            return 10;
        }
        else{
            return 20;
        }
    }
    
    public static int haveWord(char[] ch){
        Pattern p1 = Pattern.compile("[a-z]");
        Pattern p2 = Pattern.compile("[A-Z]");
        if(p1.matcher(String.valueOf(ch)).find() && p2.matcher(String.valueOf(ch)).find()){
            return 20;
        }
        else{
            int count = 0;
            for(char c : ch){
                if(String.valueOf(c).matches("[a-z]") || String.valueOf(c).matches("[A-Z]")){
                    count++;
                }
            }
            if(count>0){
                return 10;
            }
            else{
                return 0;
            }
        }
    }
    
    public static int haveOther(char[] ch){
        int count = 0;
        for(char c : ch){
            if(String.valueOf(c).matches("[^a-zA-Z0-9]")){
                count++;
            }
        }
        if(count == 0){
            return 0;
        }
        else if(count == 1){
            return 10;
        }
        else{
            return 25;
        }
    }
    
    public static int award(char[] ch){
        int count = 0;
        int count1 = 0;
        int count2 = 0;
        Pattern p1 = Pattern.compile("[0-9]");
        if(p1.matcher(String.valueOf(ch)).find()){
            count++;
        }
        Pattern p2 = Pattern.compile("[a-z]");
        if(p2.matcher(String.valueOf(ch)).find()){
            count1++;
        }
        Pattern p3 = Pattern.compile("[A-Z]");
        if(p3.matcher(String.valueOf(ch)).find()){
            count1++;
        }
        Pattern p4 = Pattern.compile("[^a-zA-Z0-9]");
        if(p4.matcher(String.valueOf(ch)).find()){
            count2++;
        }
        if(count == 1 && count2 == 0 && count1>0){
            return 2;
        }
        else if(count == 1 && count2 == 1 && count1 == 1){
            return 3;
        }
        else if(count == 1 && count2 == 1 && count1 == 2){
            return 5;
        }
        else{
            return 0;
        }
    }
    
    public static void getScore(int n){
        if(n>=90){
            System.out.println("VERY_SECURE");
        }
        else if(n>=80 && n<90){
            System.out.println("SECURE");
        }
        else if(n>=70 && n<80){
            System.out.println("VERY_STRONG");
        }
        else if(n>=60 && n<70){
            System.out.println("STRONG");
        }
        else if(n>=50 && n<60){
            System.out.println("AVERAGE");
        }
        else if(n>=25 && n<50){
            System.out.println("WEAK");
        }
        else{
            System.out.println("VERY_WEAK");
        }
    }
}













全部评论

相关推荐

HNU_fsq:建议直接出国,这简历太6了。自愧不如
点赞 评论 收藏
分享
2 收藏 评论
分享
牛客网
牛客企业服务