LeetCode 솔루션 분류
[6/27] 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
본문
Medium
890633Add to ListShareA decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For example, 101 and 1100 are deci-binary, while 112 and 3001 are not.
Given a string n that represents a positive decimal integer, return the minimum number of positive deci-binary numbers needed so that they sum up to n.
Example 1:
Input: n = "32" Output: 3 Explanation: 10 + 11 + 11 = 32
Example 2:
Input: n = "82734" Output: 8
Example 3:
Input: n = "27346209830709182346" Output: 9
Constraints:
1 <= n.length <= 105nconsists of only digits.ndoes not contain any leading zeros and represents a positive integer.
관련자료
-
링크
댓글 1
학부유학생님의 댓글
- 익명
- 작성일
Runtime: 265 ms, faster than 32.55% of Python3 online submissions for Partitioning Into Minimum Number Of Deci-Binary Numbers.
Memory Usage: 14.7 MB, less than 83.98% of Python3 online submissions for Partitioning Into Minimum Number Of Deci-Binary Numbers.
Memory Usage: 14.7 MB, less than 83.98% of Python3 online submissions for Partitioning Into Minimum Number Of Deci-Binary Numbers.
class Solution:
def minPartitions(self, n: str) -> int:
return max(int(i) for i in n)
