Leetcode 2299. Strong Password Checker II

A password is said to be strong if it satisfies all the following criteria:

• It has at least 8 characters.

• It contains at least one lowercase letter.

• It contains at least one uppercase letter.

• It contains at least one digit.

• It contains at least one special character. The special characters are the characters in the following string: "!@#$%^&*()-+".

• It does not contain 2 of the same character in adjacent positions (i.e., "aab" violates this condition, but "aba" does not).

Given a string password, return true if it is a strong password. Otherwise, return false.

Example 1:

Input: password = "IloveLe3tcode!"Output: trueExplanation: The password meets all the requirements. Therefore, we return true.

Example 2:

Input: password = "Me+You--IsMyDream"Output: falseExplanation: The password does not contain a digit and also contains 2 of the same character in adjacent positions. Therefore, we return false.

Example 3:

Input: password = "1aB!"Output: falseExplanation: The password does not meet the length requirement. Therefore, we return false.

Constraints:

• 1 <= password.length <= 100

• password consists of letters, digits, and special characters: "!@#$%^&*()-+".

针对于每个限制条件写一个方法，最终合并；

Runtime: 1 ms, faster than 81.19% of Java online submissions for Strong Password Checker II.

Memory Usage: 40.3 MB, less than 73.13% of Java online submissions for Strong Password Checker II.