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 } }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· .NET10 - 预览版1新功能体验(一)
2021-02-12 918. Maximum Sum Circular Subarray