2299. 强密码检验器 II

Author: w2xi

README.md

@@ -185,6 +185,7 @@
 |2283|[判断一个数的数字计数是否等于数位的值](https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/)|[JavaScript](./algorithms/check-if-number-has-equal-digit-count-and-digit-value.js)|Easy|
 |2287|[重排字符形成目标字符串](https://leetcode.cn/problems/rearrange-characters-to-make-target-string/)|[JavaScript](./algorithms/rearrange-characters-to-make-target-string.js)|Easy|
 |2293|[极大极小游戏](https://leetcode.cn/problems/min-max-game/)|[JavaScript](./algorithms/min-max-game.js)|Easy|
+|2299|[强密码检验器 II](https://leetcode.cn/problems/strong-password-checker-ii/)|[JavaScript](./algorithms/strong-password-checker-ii.js)|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|
 |剑指 Offer 05. 替换空格|[剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)|[JavaScript](./algorithms/ti-huan-kong-ge-lcof.js)|Easy|

algorithms/strong-password-checker-ii.js

@@ -0,0 +1,43 @@
+/**
+ * 2299. 强密码检验器 II
+ * @param {string} password
+ * @return {boolean}
+ */
+var strongPasswordCheckerII = function (password) {
+  if (password.length < 8) return false;
+  let lowerCaseFlag = false;
+  let upperCaseFlag = false;
+  let digitFlag = false;
+  let specialCharFlag = false;
+
+  const isLowerCase = (c) => c >= "a" && c <= "z";
+  const isUpperCase = (c) => c >= "A" && c <= "Z";
+  const isNumber = (c) => c >= "0" && c <= "9";
+  const specialSet = new Set("!@#$%^&*()-+");
+
+  let perv = "";
+
+  for (let i = 0; i < password.length; i++) {
+    let char = password[i];
+
+    if (perv === char) {
+      return false;
+    }
+    perv = char;
+
+    if (isLowerCase(char)) {
+      lowerCaseFlag = true;
+    }
+    if (isUpperCase(char)) {
+      upperCaseFlag = true;
+    }
+    if (isNumber(char)) {
+      digitFlag = true;
+    }
+    if (!specialCharFlag && specialSet.has(char)) {
+      specialCharFlag = true;
+    }
+  }
+
+  return lowerCaseFlag && upperCaseFlag && digitFlag && specialCharFlag;
+};