C语言 | Leetcode C语言题解之第523题连续的子数组和

题目：

题解：

struct HashTable {int key, val;UT_hash_handle hh;
};bool checkSubarraySum(int* nums, int numsSize, int k) {int m = numsSize;if (m < 2) {return false;}struct HashTable* hashTable = NULL;struct HashTable* tmp = malloc(sizeof(struct HashTable));tmp->key = 0, tmp->val = -1;HASH_ADD_INT(hashTable, key, tmp);int remainder = 0;for (int i = 0; i < m; i++) {remainder = (remainder + nums[i]) % k;HASH_FIND_INT(hashTable, &remainder, tmp);if (tmp != NULL) {int prevIndex = tmp->val;if (i - prevIndex >= 2) {return true;}} else {tmp = malloc(sizeof(struct HashTable));tmp->key = remainder, tmp->val = i;HASH_ADD_INT(hashTable, key, tmp);}}return false;
}