update

Author: OneCodeMonkey

contest/leetcode_week_251/leetcode_1945_sum_of_digits_of_string_after_convert.java

@@ -0,0 +1,31 @@
+// AC
+class Solution {
+    public int getLucky(String s, int k) {
+        int sumDigit = 0;
+        for (char c: s.toCharArray()) {
+            int temp = c - 'a' + 1;
+            if (temp < 10) {
+                sumDigit += temp;
+            } else {
+                sumDigit += (temp / 10) + (temp % 10);
+            }
+        }
+
+        int tranSumDigit = sumDigit;
+        if (k > 1) {
+            for (int i = 1; i < k; i++) {
+                int copy = tranSumDigit;
+                tranSumDigit = 0;
+                while (copy > 0) {
+                    tranSumDigit += copy % 10;
+                    copy /= 10;
+                }
+                if (tranSumDigit < 10) {
+                    break;
+                }
+            }
+        }
+
+        return tranSumDigit;
+    }
+}

contest/leetcode_week_251/leetcode_1946_Largest_Number_After_Mutating_Substring.java

@@ -0,0 +1,25 @@
+// AC
+class Solution {
+    public String maximumNumber(String num, int[] change) {
+        int size = num.length();
+        StringBuilder ret = new StringBuilder();
+        boolean started = false, stopped = false, everChanged = false;
+        for (int i = 0; i < size; i++) {
+            int digit = Integer.parseInt(String.valueOf(num.charAt(i)));
+            if (change[digit] >= digit && !stopped) {
+                started = true;
+                ret.append(change[digit]);
+                if (change[digit] > digit) {
+                    everChanged = true;
+                }
+            } else {
+                ret.append(digit);
+                if (started && everChanged) {
+                    stopped = true;
+                }
+            }
+        }
+
+        return ret.toString();
+    }
+}