Find All Numbers Disappeared in an Array

class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        for (int v : nums) {
            int i = abs(v) - 1;
            if (nums[i] > 0) nums[i] = -nums[i];
        }
        vector<int> ans;
        for (int i = 0; i < (int)nums.size(); ++i)
            if (nums[i] > 0) ans.push_back(i + 1);
        return ans;
    }
};

func findDisappearedNumbers(nums []int) []int {
    for _, v := range nums {
        i := v
        if i < 0 {
            i = -i
        }
        i--
        if nums[i] > 0 {
            nums[i] = -nums[i]
        }
    }
    ans := []int{}
    for i, v := range nums {
        if v > 0 {
            ans = append(ans, i+1)
        }
    }
    return ans
}

from typing import List

class Solution:
    def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
        for v in nums:
            i = abs(v) - 1
            if nums[i] > 0:
                nums[i] = -nums[i]
        return [i + 1 for i, v in enumerate(nums) if v > 0]

function findDisappearedNumbers(nums) {
    for (const v of nums) {
        const i = Math.abs(v) - 1;
        if (nums[i] > 0) nums[i] = -nums[i];
    }
    const ans = [];
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] > 0) ans.push(i + 1);
    }
    return ans;
}

class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        for (int v : nums) {
            int i = Math.abs(v) - 1;
            if (nums[i] > 0) nums[i] = -nums[i];
        }
        List<Integer> ans = new ArrayList<>();
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > 0) ans.add(i + 1);
        }
        return ans;
    }
}

function findDisappearedNumbers(nums: number[]): number[] {
    for (const v of nums) {
        const i = Math.abs(v) - 1;
        if (nums[i] > 0) nums[i] = -nums[i];
    }
    const ans: number[] = [];
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] > 0) ans.push(i + 1);
    }
    return ans;
}