aboutsummaryrefslogtreecommitdiff
path: root/max_69_number.py
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-08-16 12:13:50 -0600
committerJack Sangdahl <[email protected]>2025-08-16 12:13:50 -0600
commitf359b85a14d62e61cd108f8c1f5818f08cde5a20 (patch)
treeeaf99b77a4503de6e8b88fa02c6cd1f3420a6d5c /max_69_number.py
parentf035e4f04939219d5979f67d9e36b307a60d15fb (diff)
downloadleetcode-f359b85a14d62e61cd108f8c1f5818f08cde5a20.tar.gz
leetcode-f359b85a14d62e61cd108f8c1f5818f08cde5a20.zip
1323. maximum 69 number
Diffstat (limited to 'max_69_number.py')
-rw-r--r--max_69_number.py23
1 files changed, 23 insertions, 0 deletions
diff --git a/max_69_number.py b/max_69_number.py
new file mode 100644
index 0000000..e8c843d
--- /dev/null
+++ b/max_69_number.py
@@ -0,0 +1,23 @@
+# 1323. Maximum 69 Number
+
+"""
+you are given a positive integer 'num' consisting only of digit 6 and 9.
+return the maximum number you can get by changing at most one digit. (6
+becomes 9, and 9 becomes 6).
+"""
+
+
+class Solution(object):
+ def maximum69Number(self, num):
+ """
+ :type num: int
+ :rtype: int
+ """
+ return int(str(num).replace("6", "9", 1))
+
+
+if __name__ == "__main__":
+ obj = Solution()
+ print(obj.maximum69Number(9669))
+ print(obj.maximum69Number(9996))
+ print(obj.maximum69Number(9999))