Add solution #1432

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,299 LeetCode solutions in JavaScript
+# 1,300 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1092,6 +1092,7 @@
 1424|[Diagonal Traverse II](./solutions/1424-diagonal-traverse-ii.js)|Medium|
 1425|[Constrained Subsequence Sum](./solutions/1425-constrained-subsequence-sum.js)|Hard|
 1431|[Kids With the Greatest Number of Candies](./solutions/1431-kids-with-the-greatest-number-of-candies.js)|Easy|
+1432|[Max Difference You Can Get From Changing an Integer](./solutions/1432-max-difference-you-can-get-from-changing-an-integer.js)|Medium|
 1436|[Destination City](./solutions/1436-destination-city.js)|Easy|
 1437|[Check If All 1's Are at Least Length K Places Away](./solutions/1437-check-if-all-1s-are-at-least-length-k-places-away.js)|Easy|
 1443|[Minimum Time to Collect All Apples in a Tree](./solutions/1443-minimum-time-to-collect-all-apples-in-a-tree.js)|Medium|

solutions/1432-max-difference-you-can-get-from-changing-an-integer.js

@@ -0,0 +1,61 @@
+/**
+ * 1432. Max Difference You Can Get From Changing an Integer
+ * https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/
+ * Difficulty: Medium
+ *
+ * You are given an integer num. You will apply the following steps exactly two times:
+ * - Pick a digit x (0 <= x <= 9).
+ * - Pick another digit y (0 <= y <= 9). The digit y can be equal to x.
+ * - Replace all the occurrences of x in the decimal representation of num by y.
+ * - The new integer cannot have any leading zeros, also the new integer cannot be 0.
+ *
+ * Let a and b be the results of applying the operations to num the first and second times,
+ * respectively.
+ *
+ * Return the max difference between a and b.
+ */
+
+/**
+ * @param {number} num
+ * @return {number}
+ */
+var maxDiff = function(num) {
+  const digits = num.toString().split('');
+
+  const maxNum = digits.slice();
+  for (let i = 0; i < maxNum.length; i++) {
+    if (maxNum[i] !== '9') {
+      const target = maxNum[i];
+      for (let j = i; j < maxNum.length; j++) {
+        if (maxNum[j] === target) {
+          maxNum[j] = '9';
+        }
+      }
+      break;
+    }
+  }
+
+  const minNum = digits.slice();
+  if (minNum[0] !== '1') {
+    const target = minNum[0];
+    for (let j = 0; j < minNum.length; j++) {
+      if (minNum[j] === target) {
+        minNum[j] = '1';
+      }
+    }
+  } else {
+    for (let i = 1; i < minNum.length; i++) {
+      if (minNum[i] !== '0' && minNum[i] !== '1') {
+        const target = minNum[i];
+        for (let j = i; j < minNum.length; j++) {
+          if (minNum[j] === target) {
+            minNum[j] = '0';
+          }
+        }
+        break;
+      }
+    }
+  }
+
+  return parseInt(maxNum.join('')) - parseInt(minNum.join(''));
+};