GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing leetcodejavascript.com — #2578 - Split With Minimum Sum - LeetCode JavaScript Solutions

Back to all solutions

#2578 - Split With Minimum Sum

Easy • View on LeetCode • View on GitHub

Math Sorting Greedy

Problem Description

Given a positive integer num, split it into two non-negative integers num1 and num2 such that:

The concatenation of num1 and num2 is a permutation of num.
- In other words, the sum of the number of occurrences of each digit in num1 and num2 is equal to the number of occurrences of that digit in num.
num1 and num2 can contain leading zeros.

Return the minimum possible sum of num1 and num2.

Notes:

It is guaranteed that num does not contain any leading zeros.
The order of occurrence of the digits in num1 and num2 may differ from the order of occurrence of num.

Solution

/**
 * @param {number} num
 * @return {number}
 */
var splitNum = function(num) {
  const digits = String(num).split('').sort((a, b) => a - b);
  let num1 = '';
  let num2 = '';

  for (let i = 0; i < digits.length; i++) {
    if (i % 2 === 0) {
      num1 += digits[i];
    } else {
      num2 += digits[i];
    }
  }

  return Number(num1) + Number(num2);
};

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.