Easy
You are given a 0-indexed integer array nums
.
The concatenation of two numbers is the number formed by concatenating their numerals.
15
, 49
is 1549
.The concatenation value of nums
is initially equal to 0
. Perform this operation until nums
becomes empty:
nums
, pick the first element and last element in nums
respectively and add the value of their concatenation to the concatenation value of nums
, then delete the first and last element from nums
.nums
, then delete it.Return the concatenation value of the nums
.
Example 1:
Input: nums = [7,52,2,4]
Output: 596
Explanation: Before performing any operation, nums is [7,52,2,4] and concatenation value is 0.
In the first operation: We pick the first element, 7, and the last element, 4. Their concatenation is 74, and we add it to the concatenation value, so it becomes equal to 74. Then we delete them from nums, so nums becomes equal to [52,2].
In the second operation: We pick the first element, 52, and the last element, 2. Their concatenation is 522, and we add it to the concatenation value, so it becomes equal to 596. Then we delete them from the nums, so nums becomes empty. Since the concatenation value is 596 so the answer is 596.
Example 2:
Input: nums = [5,14,13,8,12]
Output: 673
Explanation: Before performing any operation, nums is [5,14,13,8,12] and concatenation value is 0.
In the first operation: We pick the first element, 5, and the last element, 12. Their concatenation is 512, and we add it to the concatenation value, so it becomes equal to 512. Then we delete them from the nums, so nums becomes equal to [14,13,8].
In the second operation: We pick the first element, 14, and the last element, 8. Their concatenation is 148, and we add it to the concatenation value, so it becomes equal to 660. Then we delete them from the nums, so nums becomes equal to [13].
In the third operation: nums has only one element, so we pick 13 and add it to the concatenation value, so it becomes equal to 673. Then we delete it from nums, so nums become empty. Since the concatenation value is 673 so the answer is 673.
Constraints:
1 <= nums.length <= 1000
1 <= nums[i] <= 104
public class Solution {
public long findTheArrayConcVal(int[] nums) {
long sum = 0;
int idxLeft = 0;
int idxRight = nums.length - 1;
while (idxLeft < idxRight) {
sum += getConcatenationValue(nums[idxLeft], nums[idxRight]);
++idxLeft;
--idxRight;
}
if (idxLeft == idxRight) {
sum += nums[idxLeft];
}
return sum;
}
private long getConcatenationValue(int leftVal, int rightVal) {
if ((long) rightVal == 10000) {
return leftVal * 100000L + rightVal;
}
if ((long) rightVal >= 1000) {
return leftVal * 10000L + rightVal;
}
if ((long) rightVal >= 100) {
return leftVal * 1000L + rightVal;
}
if ((long) rightVal >= 10) {
return leftVal * 100L + rightVal;
}
return leftVal * 10L + rightVal;
}
}