-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStrongPassword.java
More file actions
52 lines (44 loc) · 1.35 KB
/
Copy pathStrongPassword.java
File metadata and controls
52 lines (44 loc) · 1.35 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
static boolean containsUpperCase(String s) {
return (s == null) ? false : s.matches(".*[A-Z]+.*");
}
static boolean containsLowerCase(String s) {
return (s == null) ? false : s.matches(".*[a-z]+.*");
}
static boolean containsNumber(String s) {
return (s == null) ? false : s.matches(".*[0-9]+.*");
}
static boolean containsSymbol(String s) {
return (s == null) ? false : s.matches(".*[^A-Za-z0-9]+.*");
}
static int minimumNumber(int n, String password) {
int lenDiff = n >= 6 ? 0 : 6 - n;
int charDiff = 0;
if (!containsUpperCase(password)) {
charDiff++;
}
if (!containsLowerCase(password)) {
charDiff++;
}
if (!containsNumber(password)) {
charDiff++;
}
if (!containsSymbol(password)) {
charDiff++;
}
return Math.max(lenDiff, charDiff);
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
String password = in.next();
int answer = minimumNumber(n, password);
System.out.println(answer);
in.close();
}
}