refactor 420

fishercoder1534 · fishercoder1534 · commit b5f3176cd383 · 2019-03-22T08:25:06.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_420.java b/src/main/java/com/fishercoder/solutions/_420.java
@@ -1,76 +1,83 @@
 package com.fishercoder.solutions;
 
-/**A password is considered strong if below conditions are all met:
+/**
+ * 420. Strong Password Checker
+ *
+ * A password is considered strong if below conditions are all met:
 
  It has at least 6 characters and at most 20 characters.
  It must contain at least one lowercase letter, at least one uppercase letter, and at least one digit.
  It must NOT contain three repeating characters in a row ("...aaa..." is weak, but "...aa...a..." is strong, assuming other conditions are met).
- Write a function strongPasswordChecker(s), that takes a string s as input, and return the MINIMUM change required to make s a strong password. If s is already strong, return 0.
-
- Insertion, deletion or replace of any one character are all considered as one change.*/
+ Write a function strongPasswordChecker(s), that takes a string s as input, and return the MINIMUM
+ change required to make s a strong password. If s is already strong, return 0.
+ Insertion, deletion or replace of any one character are all considered as one change.
+ */
 public class _420 {
-    /**Looked at this solution: https://discuss.leetcode.com/topic/63854/o-n-java-solution-by-analyzing-changes-allowed-to-fix-each-condition*/
-    public int strongPasswordChecker(String s) {
-        int res = 0;
-        int a = 1;
-        int A = 1;
-        int d = 1;
-        char[] carr = s.toCharArray();
-        int[] arr = new int[carr.length];
+    public static class Solution1 {
+        /**
+         * credit: https://discuss.leetcode.com/topic/63854/o-n-java-solution-by-analyzing-changes-allowed-to-fix-each-condition
+         */
+        public int strongPasswordChecker(String s) {
+            int res = 0;
+            int a = 1;
+            int A = 1;
+            int d = 1;
+            char[] carr = s.toCharArray();
+            int[] arr = new int[carr.length];
 
-        for (int i = 0; i < arr.length;) {
-            if (Character.isLowerCase(carr[i])) {
-                a = 0;
-            }
-            if (Character.isUpperCase(carr[i])) {
-                A = 0;
-            }
-            if (Character.isDigit(carr[i])) {
-                d = 0;
-            }
+            for (int i = 0; i < arr.length; ) {
+                if (Character.isLowerCase(carr[i])) {
+                    a = 0;
+                }
+                if (Character.isUpperCase(carr[i])) {
+                    A = 0;
+                }
+                if (Character.isDigit(carr[i])) {
+                    d = 0;
+                }
 
-            int j = i;
-            while (i < carr.length && carr[i] == carr[j]) {
-                i++;
+                int j = i;
+                while (i < carr.length && carr[i] == carr[j]) {
+                    i++;
+                }
+                arr[j] = i - j;
             }
-            arr[j] = i - j;
-        }
 
-        int totalMissing = (a + A + d);
+            int totalMissing = (a + A + d);
 
-        if (arr.length < 6) {
-            res += totalMissing + Math.max(0, 6 - (arr.length + totalMissing));
-        } else {
-            int overLen = Math.max(arr.length - 20, 0);
-            int leftOver = 0;
-            res += overLen;
+            if (arr.length < 6) {
+                res += totalMissing + Math.max(0, 6 - (arr.length + totalMissing));
+            } else {
+                int overLen = Math.max(arr.length - 20, 0);
+                int leftOver = 0;
+                res += overLen;
 
-            for (int k = 1; k < 3; k++) {
-                for (int i = 0; i < arr.length && overLen > 0; i++) {
-                    if (arr[i] < 3 || arr[i] % 3 != (k - 1)) {
-                        continue;
+                for (int k = 1; k < 3; k++) {
+                    for (int i = 0; i < arr.length && overLen > 0; i++) {
+                        if (arr[i] < 3 || arr[i] % 3 != (k - 1)) {
+                            continue;
+                        }
+                        arr[i] -= Math.min(overLen, k);
+                        overLen -= k;
                     }
-                    arr[i] -= Math.min(overLen, k);
-                    overLen -= k;
                 }
-            }
 
-            for (int i = 0; i < arr.length; i++) {
-                if (arr[i] >= 3 && overLen > 0) {
-                    int need = arr[i] - 2;
-                    arr[i] -= overLen;
-                    overLen -= need;
-                }
+                for (int i = 0; i < arr.length; i++) {
+                    if (arr[i] >= 3 && overLen > 0) {
+                        int need = arr[i] - 2;
+                        arr[i] -= overLen;
+                        overLen -= need;
+                    }
 
-                if (arr[i] >= 3) {
-                    leftOver += arr[i] / 3;
+                    if (arr[i] >= 3) {
+                        leftOver += arr[i] / 3;
+                    }
                 }
+
+                res += Math.max(totalMissing, leftOver);
             }
 
-            res += Math.max(totalMissing, leftOver);
+            return res;
         }
-
-        return res;
     }
-
 }
