Simple java 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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\no(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\no(n)\n\n# Code\n```\nclass Solution {\n    public long findTheArrayConcVal(int[] nums) {\n        String x="";\n        ArrayList<String>a=new ArrayList<String>();\n        int i=0,j=nums.length-1;\n        while(i<=j)\n        {\n            if(i==j)\n            {\n                x+=String.valueOf(nums[i]);\n                a.add(x);\n            }\n            else\n            {\n                x+=String.valueOf(nums[i]);\n                x+=String.valueOf(nums[j]);\n                a.add(x);\n            }\n            x="";\n            i++;\n            j--;\n            \n        }\n        long ans=0;\n        for(int k=0;k<a.size();k++)\n        {\n            ans+=Integer.parseInt(a.get(k));\n        }\n        return ans;\n    }\n}\n```\n![upvote.jpg](https://assets.leetcode.com/users/images/dd31493b-c584-47cb-bf99-381ac4f26496_1679301958.657793.jpeg)\n
['Array', 'Two Pointers', 'Simulation', 'Java']