6354. 找出数组的串联值

Author: w2xi

README.md

@@ -226,6 +226,7 @@
 |2331|[计算布尔二叉树的值](https://leetcode.cn/problems/evaluate-boolean-binary-tree/)|[JavaScript](./algorithms/evaluate-boolean-binary-tree.js)|Easy|
 |2335|[装满杯子需要的最短总时长](https://leetcode.cn/problems/minimum-amount-of-time-to-fill-cups/)|[JavaScript](./algorithms/minimum-amount-of-time-to-fill-cups.js)|Easy|
 |2351|[第一个出现两次的字母](https://leetcode.cn/problems/first-letter-to-appear-twice/)|[JavaScript](./algorithms/first-letter-to-appear-twice.js)|Easy|
+|6354|[找出数组的串联值](https://leetcode.cn/problems/find-the-array-concatenation-value/)|[JavaScript](./algorithms/find-the-array-concatenation-value.js)|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|
 |剑指 Offer 05. 替换空格|[剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)|[JavaScript](./algorithms/ti-huan-kong-ge-lcof.js)|Easy|

algorithms/find-the-array-concatenation-value.js

@@ -0,0 +1,21 @@
+/**
+ * 6354. 找出数组的串联值
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findTheArrayConcVal = function (nums) {
+  let result = 0;
+  let left = 0;
+  let right = nums.length - 1;
+
+  while (left < right) {
+    const curr = `${nums[left]}${nums[right]}`;
+    result += Number(curr);
+    left++;
+    right--;
+  }
+  if (nums.length % 2 !== 0) {
+    result += nums[left];
+  }
+  return result;
+};