167. \u4e24\u6570\u4e4b\u548c II – \u8f93\u5165\u6709\u5e8f\u6570\u7ec4<\/p>\n
\u7ed9\u4f60\u4e00\u4e2a\u4e0b\u6807\u4ece\u00a01\u00a0\u5f00\u59cb\u7684\u6574\u6570\u6570\u7ec4\u00a0numbers\u00a0，\u8be5\u6570\u7ec4\u5df2\u6309\u00a0\u975e\u9012\u51cf\u987a\u5e8f\u6392\u5217\u00a0\u00a0，\u8bf7\u4f60\u4ece\u6570\u7ec4\u4e2d\u627e\u51fa\u6ee1\u8db3\u76f8\u52a0\u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570\u00a0target\u00a0\u7684\u4e24\u4e2a\u6570\u3002\u5982\u679c\u8bbe\u8fd9\u4e24\u4e2a\u6570\u5206\u522b\u662f\u00a0numbers[index1]\u00a0\u548c\u00a0numbers[index2]\u00a0，\u5219\u00a01 <= index1 < index2 <= numbers.length\u00a0\u3002<\/p>\n
\u4ee5\u957f\u5ea6\u4e3a 2 \u7684\u6574\u6570\u6570\u7ec4\u00a0[index1, index2]\u00a0\u7684\u5f62\u5f0f\u8fd4\u56de\u8fd9\u4e24\u4e2a\u6574\u6570\u7684\u4e0b\u6807\u00a0index1\u00a0\u548c\u00a0index2\u3002<\/p>\n
\u4f60\u53ef\u4ee5\u5047\u8bbe\u6bcf\u4e2a\u8f93\u5165\u00a0\u53ea\u5bf9\u5e94\u552f\u4e00\u7684\u7b54\u6848\u00a0，\u800c\u4e14\u4f60\u00a0\u4e0d\u53ef\u4ee5\u00a0\u91cd\u590d\u4f7f\u7528\u76f8\u540c\u7684\u5143\u7d20\u3002<\/p>\n
\u4f60\u6240\u8bbe\u8ba1\u7684\u89e3\u51b3\u65b9\u6848\u5fc5\u987b\u53ea\u4f7f\u7528\u5e38\u91cf\u7ea7\u7684\u989d\u5916\u7a7a\u95f4\u3002（\u4ee3\u7801\u7a7a\u95f4\u590d\u6742\u5ea6\u662fO(1)<\/span>）<\/p>\n \u793a\u4f8b 1：<\/p>\n \u8f93\u5165：numbers = [2,7,11,15], target = 9 \u793a\u4f8b 2：<\/p>\n \u8f93\u5165：numbers = [2,3,4], target = 6 \u793a\u4f8b 3：<\/p>\n \u8f93\u5165：numbers = [-1,0], target = -1 \u4e24\u6570\u4e4b\u548c<\/p>\n \u7ed9\u5b9a\u4e00\u4e2a\u6574\u6570\u6570\u7ec4\u00a0nums\u00a0\u548c\u4e00\u4e2a\u6574\u6570\u76ee\u6807\u503c\u00a0target，\u8bf7\u4f60\u5728\u8be5\u6570\u7ec4\u4e2d\u627e\u51fa\u00a0\u548c\u4e3a\u76ee\u6807\u503c\u00a0target\u00a0 \u7684\u90a3\u00a0\u4e24\u4e2a\u00a0\u6574\u6570，\u5e76\u8fd4\u56de\u5b83\u4eec\u7684\u6570\u7ec4\u4e0b\u6807\u3002<\/p>\n \u4f60\u53ef\u4ee5\u5047\u8bbe\u6bcf\u79cd\u8f93\u5165\u53ea\u4f1a\u5bf9\u5e94\u4e00\u4e2a\u7b54\u6848，\u5e76\u4e14\u4f60\u4e0d\u80fd\u4f7f\u7528\u4e24\u6b21\u76f8\u540c\u7684\u5143\u7d20\u3002<\/p>\n \u4f60\u53ef\u4ee5\u6309\u4efb\u610f\u987a\u5e8f\u8fd4\u56de\u7b54\u6848\u3002<\/p>\n \u6cd51：<\/p>\n \u65f6\u95f4\u590d\u6742\u5ea6：O(N2)，\u5176\u4e2d\u00a0N\u00a0\u662f\u6570\u7ec4\u4e2d\u7684\u5143\u7d20\u6570\u91cf\u3002\u6700\u574f\u60c5\u51b5\u4e0b\u6570\u7ec4\u4e2d\u4efb\u610f\u4e24\u4e2a\u6570\u90fd\u8981\u88ab\u5339\u914d\u4e00\u6b21\u3002<\/p>\n<\/li>\n \u7a7a\u95f4\u590d\u6742\u5ea6：O(1)\u3002<\/p>\n<\/li>\n<\/ul>\n int* twoSum(int* nums, int numsSize, int target, int* returnSize) { returnArray = (int*)malloc(2*sizeof(int));\/\/ \u5b9a\u4e49returnArray[2] return returnArray; \u6cd52：<\/p>\n \u65f6\u95f4\u590d\u6742\u5ea6：O(N)，\u5176\u4e2d N \u662f\u6570\u7ec4\u4e2d\u7684\u5143\u7d20\u6570\u91cf\u3002\u5bf9\u4e8e\u6bcf\u4e00\u4e2a\u5143\u7d20 x，\u6211\u4eec\u53ef\u4ee5 O(1) \u5730\u5bfb\u627e target – x\u3002<\/p>\n \u7a7a\u95f4\u590d\u6742\u5ea6：O(N)，\u5176\u4e2d N \u662f\u6570\u7ec4\u4e2d\u7684\u5143\u7d20\u6570\u91cf\u3002\u4e3b\u8981\u4e3a\u54c8\u5e0c\u8868\u7684\u5f00\u9500\u3002<\/p>\n #include "stdio.h" typedef struct { hashTable* hashtable;<\/p>\n hashTable* find(int ikey) { void insert(int ikey, int ival) { int* twoSum(int* nums, int numsSize, int target, int* returnSize) { printf("%d %d\\\\n", ret[0], ret[1]); *returnSize = 0; int main() twoSum(num, 4, 9, returnSize);<\/p>\n return 0; \u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb318\u6b21\uff0c\u70b9\u8d5e3\u6b21\uff0c\u6536\u85cf5\u6b21\u3002\u5728\u529b\u6263\u4e0aC\u8bed\u8a00\u7ec3\u624b\u78e8\u65f6\u95f4\uff0c\u968f\u610f\u8bb0\u5f55\u4ee3\u7801\u6ce8\u91ca<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[174,3355,1813,427],"topic":[],"class_list":{"0":"post-38359","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"hentry","6":"category-server","7":"tag-c","9":"tag-1813","10":"tag-427"},"yoast_head":"\n
\n\u8f93\u51fa：[1,2]
\n\u89e3\u91ca：2 \u4e0e 7 \u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570 9 \u3002\u56e0\u6b64 index1 = 1, index2 = 2 \u3002\u8fd4\u56de [1, 2] \u3002 <\/p>\n
\n\u8f93\u51fa：[1,3]
\n\u89e3\u91ca：2 \u4e0e 4 \u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570 6 \u3002\u56e0\u6b64 index1 = 1, index2 = 3 \u3002\u8fd4\u56de [1, 3] \u3002 <\/p>\n
\n\u8f93\u51fa：[1,2]
\n\u89e3\u91ca：-1 \u4e0e 0 \u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570 -1 \u3002\u56e0\u6b64 index1 = 1, index2 = 2 \u3002\u8fd4\u56de [1, 2] \u3002 <\/p>\n
\n\n
\n int* returnArray;
\nint i, j;<\/p>\n
\nfor (i = 0; i < numsSize-1; i++) {
\nfor (j = i + 1; j < numsSize; j++) {
\nif ((nums[i] + nums[j]) == target) {
\n\/\/ printf("%d, %d\\\\n", i, j);
\nreturnArray[0] = i;
\nreturnArray[1] = j;
\n*returnSize = 2;
\nreturn returnArray;
\n}
\n}
\n}<\/p>\n
\n} <\/p>\n
\n#include "stdlib.h"
\n#include "uthash.h"<\/p>\n
\nint key;
\nint val;
\nUT_hash_handle hh;
\n} hashTable;<\/p>\n
\nhashTable* tmp;
\nHASH_FIND_INT(hashtable, &ikey, tmp);
\nreturn tmp;
\n}<\/p>\n
\nhashTable* it = find(ikey);
\nif (it == NULL) {\/\/ \u6ca1\u627e\u5230ikey\u5bf9\u5e94\u7684\u952e\u503c\u5bf9，\u5219\u5411hashtable\u6dfb\u52a0ikey\u5bf9\u5e94\u7684\u952e\u503c\u5bf9
\nhashTable* tmp = (hashTable* )malloc(sizeof(hashTable));
\ntmp->key = ikey;
\ntmp->val = ival;
\nHASH_ADD_INT(hashtable, key, tmp);
\n}
\nelse {\/\/ \u627e\u5230\u4e86ikey\u5bf9\u5e94\u7684\u952e\u503c\u5bf9，\u66f4\u65b0it
\nit->val = ival;
\n}
\n}<\/p>\n
\nhashtable = NULL;
\nfor (int i = 0; i < numsSize; i++) {
\nhashTable* it = find(target-nums[i]);\/\/ \u54c8\u5e0c\u8868\u4e2d\u67e5\u627etarget-nums[i]\u7684\u952e\u503c\u5bf9
\nif (it != NULL) {\/\/ \u627e\u5230\u4e86\u5143\u7d20
\nint* ret = (int* )malloc(sizeof(int)*2);\/\/ \u5b9a\u4e49ret[2]
\nret[0] = it->val;\/\/ target-nums[i]\u5143\u7d20\u4e0b\u6807
\nret[1] = i;\/\/ nums[i]\u5143\u7d20\u4e0b\u6807
\n*returnSize = 2;<\/p>\n
\nreturn ret;
\n}
\ninsert(nums[i], i);\/\/ \u54c8\u5e0c\u8868\u4e2d\u6ca1\u627e\u5230target-nums[i]\u7684\u952e\u503c\u5bf9，\u5219\u5411\u54c8\u5e0c\u8868\u4e2d\u6dfb\u52a0nums[i]\u7684\u952e\u503c\u5bf9，\u4e4b\u540e\u8fdb\u884c\u4e0b\u4e00\u8f6e，\u76f4\u5230\u627e\u5230\u5bf9\u5e94\u7684\u952e\u503c\u5bf9
\n}<\/p>\n
\nreturn NULL;\/\/ \u8f93\u5165\u6709\u95ee\u9898，\u6ca1\u6709\u5bf9\u5e94\u8f93\u51fa
\n}<\/p>\n
\n{
\nint* returnSize = (int* )malloc(sizeof(int)); \/\/ \u5fc5\u987b\u7528malloc\u521d\u59cb\u5316returnSize，\u5426\u5219twoSum\u62a5\u9519\u5199\u5165\u8bbf\u95ee\u6743\u9650\u51b2\u7a81
\nint num[4] = {2, 7, 11, 15};<\/p>\n
\n} <\/p>\n","protected":false},"excerpt":{"rendered":"