leetcode 504. Base 7
LeetCode base 504
2023-09-14 09:11:53 时间
Given an integer, return its base 7 string representation.
Example 1:
Input: 100 Output: "202"
Example 2:
Input: -7 Output: "-10"
Note: The input will be in range of [-1e7, 1e7].
class Solution(object): def convertToBase7(self, num): """ :type num: int :rtype: str """ """ Input: 100 Output: "202" 100%7=14,2 14%7=2,0 2%7=2,xxx """ is_neg = False if num < 0: num = -num is_neg = True ans = "" while num >= 7: ans = str(num%7) + ans num = num/7 ans = str(num) + ans return ans if not is_neg else "-"+ans
or
class Solution(object): def convertToBase7(self, num): """ :type num: int :rtype: str """ """ Input: 100 Output: "202" 100%7=14,2 14%7=2,0 2%7=2,xxx """ if num == 0: return '0' is_neg = False if num < 0: num = -num is_neg = True ans = "" while num != 0: ans = str(num%7) + ans num = num/7 return ans if not is_neg else "-"+ans
使用递归:
class Solution(object): def convertToBase7(self, num): """ :type num: int :rtype: str """ if num < 0: return "-"+self.convertToBase7(-num) if num < 7: return str(num) return self.convertToBase7(num/7) + str(num%7)
相关文章
- Java实现 LeetCode 817 链表组件(暴力)
- Java实现 LeetCode 808 分汤 (暴力模拟)
- Java实现 LeetCode 753 破解保险箱(递归)
- Java实现 LeetCode 661 图片平滑器(暴力)
- Java实现 LeetCode 658 找到 K 个最接近的元素(暴力)
- Java实现 LeetCode 507 完美数
- Java实现 LeetCode 53 最大子序和
- [LeetCode] Add Digits
- leetcode 872. 叶子相似的树
- 【LeetCode 简单 数组 python3】88. 合并两个有序数组
- Leetcode 面试题 17.04. 消失的数字
- Leetcode 只出现一次的数字 II
- 【Leetcode刷题Python】 LeetCode 2038. 如果相邻两个颜色均相同则删除当前颜色
- 【LeetCode】40.组合总和II