aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--max_diff_change_int.c44
-rw-r--r--max_diff_change_int.py35
2 files changed, 79 insertions, 0 deletions
diff --git a/max_diff_change_int.c b/max_diff_change_int.c
new file mode 100644
index 0000000..e272359
--- /dev/null
+++ b/max_diff_change_int.c
@@ -0,0 +1,44 @@
+// 1432. Max Difference You Can Get From Changing an Integer
+#include "leetcode.h"
+
+/*
+ * 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 occurences 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'.
+ */
+
+int maxDiff(int num) {
+ char order[10], x, y;
+ sprintf(order, "%d", num);
+ int i;
+ for (i = 0; order[i] && order[i] == '9'; i++)
+ ;
+ if (order[i]) {
+ x = order[i];
+ for (; order[i]; i++)
+ if (order[i] == x)
+ order[i] = '9';
+ }
+ int a = atoi(order);
+ sprintf(order, "%d", num);
+ for (i = 0; order[i] && (order[i] == '0' || order[i] == '1'); i++)
+ ;
+ if (order[i]) {
+ x = order[i];
+ y = (order[0] != '1') + '0';
+ for (; order[i]; i++)
+ if (order[i] == x)
+ order[i] = y;
+ }
+ int b = atoi(order);
+ return a - b;
+}
+
+int main() {
+ printf("%d\n", maxDiff(555)); // expect: 888
+ printf("%d\n", maxDiff(9)); // expect: 8
+}
diff --git a/max_diff_change_int.py b/max_diff_change_int.py
new file mode 100644
index 0000000..fbf9fb0
--- /dev/null
+++ b/max_diff_change_int.py
@@ -0,0 +1,35 @@
+# 1432. Max Difference You Can Get From Changing an Integer
+
+"""
+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 occurences 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'.
+"""
+
+
+class Solution(object):
+ def maxDiff(self, num):
+ """
+ :type num: int
+ :rtype: int
+ """
+ n = str(num)
+ maxn, minn = float("-inf"), float("inf")
+ for i in "0123456789":
+ for j in "0123456789":
+ next = n.replace(i, j)
+ if next[0] == "0" or int(next) == 0:
+ continue
+ maxn = max(maxn, int(next))
+ minn = min(minn, int(next))
+ return maxn - minn
+
+
+if __name__ == "__main__":
+ obj = Solution()
+ print(obj.maxDiff(num=555))
+ print(obj.maxDiff(num=9))