{"id":7803,"date":"2020-12-13T13:54:18","date_gmt":"2020-12-13T21:54:18","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=7803"},"modified":"2020-12-13T14:02:21","modified_gmt":"2020-12-13T22:02:21","slug":"leetcode-1689-partitioning-into-minimum-number-of-deci-binary-numbers","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/math\/leetcode-1689-partitioning-into-minimum-number-of-deci-binary-numbers\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers"},"content":{"rendered":"\n

A decimal number is called deci-binary<\/strong> if each of its digits is either 0<\/code> or 1<\/code> without any leading zeros. For example, 101<\/code> and 1100<\/code> are deci-binary<\/strong>, while 112<\/code> and 3001<\/code> are not.<\/p>\n\n\n\n

Given a string n<\/code> that represents a positive decimal integer, return the minimum<\/strong> number of positive deci-binary<\/strong> numbers needed so that they sum up to <\/em>n<\/code>.<\/em><\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> n = \"32\"\nOutput:<\/strong> 3\nExplanation:<\/strong> 10 + 11 + 11 = 32\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = \"82734\"\nOutput:<\/strong> 8\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = \"27346209830709182346\"\nOutput:<\/strong> 9\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= n.length <= 105<\/sup><\/code><\/li>
  • n<\/code> consists of only digits.<\/li>
  • n<\/code> does not contain any leading zeros and represents a positive integer.<\/li><\/ul>\n\n\n\n
    Solution: Return the max digit<\/strong><\/h2>\n\n\n\n
    Proof: For a given string, we find the maximum number m, we create m binary strings.
    for each one, check each digit, if it’s greater than 0, we mark 1 at that position and decrease the digit by 1.<\/p>\n\n\n\n
    e.g. 21534
    max is 5, we need five binary strings.
    1. 11111: 21534 -> 10423
    2. 10111: 10423 -> 00312
    3: 00111: 00312 -> 00201
    4: 00101: 00201 -> 00100
    5: 00100: 00100 -> 00000<\/p>\n\n\n\n
    We can ignore the leading zeros.<\/p>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \/\/ Author: Huahua\nclass Solution {\npublic:\n  int minPartitions(string n) {\n    return *max_element(begin(n), end(n)) - '0';\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    A 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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[49],"tags":[31,177,376],"class_list":["post-7803","post","type-post","status-publish","format-standard","hentry","category-math","tag-math","tag-medium","tag-on","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7803","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=7803"}],"version-history":[{"count":3,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7803\/revisions"}],"predecessor-version":[{"id":7807,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7803\/revisions\/7807"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=7803"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=7803"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=7803"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}