Build Array from Permutation

//Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it.

A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1 (inclusive).

Code:
#include<bits/stdc++.h>
using namespace std;

vector<int> buildArray(vector<int>& nums) 
{
        vector<int>ans;
    for(int i=0;i<nums.size();++i)
        ans.push_back(nums[nums[i]]);
    
    return ans;
}
   
int main()
{
  vector<int>nums;
  int n;
  cin>>n;
  for(int i=0;i<n;++i)
  {
    int data;
    cin>>data;
    nums.push_back(data);
  }
  buildArray(nums);
  return 0;
}