Package g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits

Class Solution

java.lang.Object
g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits.Solution
public class Solution extends Object
2160 - Minimum Sum of Four Digit Number After Splitting Digits.<p>Easy</p> <p>You are given a <strong>positive</strong> integer <code>num</code> consisting of exactly four digits. Split <code>num</code> into two new integers <code>new1</code> and <code>new2</code> by using the <strong>digits</strong> found in <code>num</code>. <strong>Leading zeros</strong> are allowed in <code>new1</code> and <code>new2</code>, and <strong>all</strong> the digits found in <code>num</code> must be used.</p> <ul> <li>For example, given <code>num = 2932</code>, you have the following digits: two <code>2</code>&rsquo;s, one <code>9</code> and one <code>3</code>. Some of the possible pairs <code>[new1, new2]</code> are <code>[22, 93]</code>, <code>[23, 92]</code>, <code>[223, 9]</code> and <code>[2, 329]</code>.</li> </ul> <p>Return <em>the <strong>minimum</strong> possible sum of</em> <code>new1</code> <em>and</em> <code>new2</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> num = 2932</p> <p><strong>Output:</strong> 52</p> <p><strong>Explanation:</strong> Some possible pairs [new1, new2] are [29, 23], [223, 9], etc.</p> <p>The minimum sum can be obtained by the pair [29, 23]: 29 + 23 = 52.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> num = 4009</p> <p><strong>Output:</strong> 13</p> <p><strong>Explanation:</strong> Some possible pairs [new1, new2] are [0, 49], [490, 0], etc.</p> <p>The minimum sum can be obtained by the pair [4, 9]: 4 + 9 = 13.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1000 <= num <= 9999</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • minimumSum

      public int minimumSum(int num)