Java || 2 Solution❤️❤️ || StringBuilder || 2 Pointer || Easy Solution||
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:0(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:0(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public long findTheArrayConcVal(int[] nums) {\n        int low = 0 , high = nums.length-1; long ans = 0L;\n        StringBuilder temp = new StringBuilder();\n        while(low<=high){\n            if(low!=high) temp.append(nums[low]).append(nums[high]);\n            else temp.append(nums[low]);\n            low++; high--;\n            ans+=(Integer.parseInt(temp.toString()));\n            temp.setLength(0);\n        }\n        return ans;\n\n        //      ANOTHER SOLUTION(try this one)\n\n        // long ans = 0L;\n        // int low = 0 , high = nums.length-1;\n        // while(low <= high){\n        //     String str1 = Long.toString(nums[low]) , str2 = Long.toString(nums[high]);\n        //     str1 = str1 + str2;\n        //     if(low == high) ans += nums[low]; \n        //     else ans +=(Long.parseLong(str1));\n        //     low++; high--;\n        // }\n        // return ans;\n    }\n}\n```
['Java']