2562. Find the Array Concatenation Value

package LeetCode_2562

/**
 * 2562. Find the Array Concatenation Value
 * https://leetcode.com/problems/find-the-array-concatenation-value/description/
 *
 * You are given a 0-indexed integer array nums.
The concatenation of two numbers is the number formed by concatenating their numerals.
For example, the concatenation of 15, 49 is 1549.
The concatenation value of nums is initially equal to 0. Perform this operation until nums becomes empty:
If there exists more than one number in 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.
If one element exists, add its value to the concatenation value of nums, then delete it.
Return the concatenation value of the nums.
 * */
class Solution {
    /**
     * Solution: two pointer, Time complexity:O(n), Space complexity:O(1)
     * */
    fun findTheArrayConcVal(nums: IntArray): Long {
        var left = 0
        val size = nums.size
        var right = size - 1
        var result: Long = 0L
        while (left < right) {
            val tempString = nums[left++].toString() + nums[right--].toString()
            result += tempString.toLong()
        }
        if (size % 2 == 1) {
            result += nums[left]
        }
        return result
    }
}