LeetCode Contains Duplicate，leetcodeduplicate

LeetCode Contains Duplicate，leetcodeduplicate
LeetCode Contains Duplicate題目

思路

剛開始還以為是什麼異或判重；
後來發現是自己想錯了- -；
還是雜湊好點。

代碼

bool containsDuplicate(int* nums, int numsSize) {    if (numsSize <= 1) return false;    int length = 100007;    if (numsSize < length) length = numsSize;    int * hash = (int*)malloc(sizeof(int) * length);    bool * used = (bool*)malloc(sizeof(bool) * length);    for (int i = 0; i < length; i++) used[i] = false;    for (int i = 0; i < numsSize; i++) {        int p = (nums[i] + numsSize) % numsSize;        while (used[p]) {            if (hash[p] == nums[i]) {                free(hash);                free(used);                return true;            }            p++;            if (p == length) p = 0;        }        hash[p] = nums[i];        used[p] = true;    }    free(hash);    free(used);    return false;}