minimum-value-of-merged-integers

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> of even length <code>n</code>.

You have to merge the elements of <code>nums</code> in pairs by merging <code>nums[0]</code> with <code>nums[1]</code>, <code>nums[2]</code> with <code>nums[3]</code>, and so on, until <code>nums[n - 2]</code> with <code>nums[n - 1]</code>.

Return the minimum value among all the resulting merged integers.

To merge two integers, concatenate all the decimal digits of the first integer followed by all the decimal digits of the second integer.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [23,55,42,21]

Output: 2355

Explanation:

<ul>
	<li>Merging <code>nums[0] = 23</code> and <code>nums[1] = 55</code> gives 2355.</li>
	<li>Merging <code>nums[2] = 42</code> and <code>nums[3] = 21</code> gives 4221.</li>
	<li>The minimum value among the merged numbers is <code>min(2355, 4221) = 2355</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: nums = [34,7,11,11]

Output: 347

Explanation:

<ul>
	<li>Merging <code>nums[0] = 34</code> and <code>nums[1] = 7</code> gives 347.</li>
	<li>Merging <code>nums[2] = 11</code> and <code>nums[3] = 11</code> gives 1111.</li>
	<li>The minimum value among the merged numbers is <code>min(347, 1111) = 347</code>.</li>
</ul>
</div>

Example 3:

<div class="example-block">
Input: nums = [9,20]

Output: 920

Explanation:

<ul>
	<li>Merging <code>nums[0] = 9</code> and <code>nums[1] = 20</code> gives 920.</li>
	<li>There is only one merged number, so the minimum value is 920.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= n == nums.length &lt;= 100</code></li>
	<li><code>n</code> is even</li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
</ul>

Weekly Contest 526

weekly-contest-526

minMergedInteger

Minimum Value of Merged Integers

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given an integer array nums of even length n.

You have to merge the elements of nums in pairs by merging nums[0] with nums[1], nums[2] with nums[3], and so on, until nums[n - 2] with nums[n - 1].

Return the minimum value among all the resulting merged integers.

To merge two integers, concatenate all the decimal digits of the first integer followed by all the decimal digits of the second integer.

 

Example 1:

Input: nums = [23,55,42,21]

Output: 2355

Explanation:

 * Merging nums[0] = 23 and nums[1] = 55 gives 2355.
 * Merging nums[2] = 42 and nums[3] = 21 gives 4221.
 * The minimum value among the merged numbers is min(2355, 4221) = 2355.

Example 2:

Input: nums = [34,7,11,11]

Output: 347

Explanation:

 * Merging nums[0] = 34 and nums[1] = 7 gives 347.
 * Merging nums[2] = 11 and nums[3] = 11 gives 1111.
 * The minimum value among the merged numbers is min(347, 1111) = 347.

Example 3:

Input: nums = [9,20]

Output: 920

Explanation:

 * Merging nums[0] = 9 and nums[1] = 20 gives 920.
 * There is only one merged number, so the minimum value is 920.

 

Constraints:

 * 2 <= n == nums.length <= 100
 * n is even
 * 1 <= nums[i] <= 1000