JAVA | VERY 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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int[] findArray(int[] pref) {\n        int n=pref.length;\n        int ans[]=new int[n];\n        ans[0]=pref[0];\n        for(int i=1;i<n;i++){\n            ans[i]=pref[i]^pref[i-1];\n        }\n        return ans;\n    }\n}\n```
['Java']