Missing Number

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

For example,
Given nums = [0, 1, 3] return 2.

Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

class Solution {
public:
    int missingNumber(vector<int>& nums) {
        int n = nums.size();
	    if (n < 1)
	    {
		    return 0;
	    }
	    int maxVal = nums[0];
	    for (int i = 1; i < n; i++)
	    {
		    if (nums[i] > maxVal)
		    {
			    maxVal = nums[i];
		    }
	    }

	    int size = maxVal/32 + 1;
	    unsigned int *p = new unsigned int[size];
	    memset(p, 0, size*sizeof(int));

	    for (int i = 0; i < n; i++)
	    {
		    int offset = nums[i] % 32;
		    int temp = 1 << offset;
		    int pos = nums[i]/32;
		    p[pos] |= temp;
	    }

	    for (int i = 0; i < size; i++)
	    {
		    if (p[i] != 0xffffffff)
		    {
			    int temp = 1;
			    for (int j = 0; j < 32; j++)
			    {
				    if ((temp&p[i]) == 0)
				    {
					    delete []p;
					    return 32*i + j;
				    }
				    temp <<= 1;
			    }
		    }
	    }
	
	    delete []p;
	    return 0;
    }
};