\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
\u66b4\u529b\u89e3\u6cd501<\/p>\n
class Solution {
\n public int[] twoSum(int[] nums, int target) {
\n for(int i=0 ; i<nums.length;i++){
\n if(index(nums,target-nums[i],i+1)>=0){
\n int number =index(nums,target-nums[i],i+1);
\n int arr[]={i,number};
\n return arr;
\n }
\n }
\n int arr[]=new int[2];
\n return arr;
\n }
\n public int index(int[] nums, int num, int startIndex){
\n for(int i=startIndex ; i<nums.length;i++){
\n if(num == nums[i]){
\n return i;
\n }
\n }
\n return -1;
\n }
\n}<\/p>\n
\u4f18\u5316\u7248\u66b4\u529b\u679a\u4e3e\u89e3\u6cd5（\u5b98\u65b9\u89e3\u6cd5）<\/p>\n
\u601d\u8def\u53ca\u7b97\u6cd5<\/p>\n
\u6700\u5bb9\u6613\u60f3\u5230\u7684\u65b9\u6cd5\u662f\u679a\u4e3e\u6570\u7ec4\u4e2d\u7684\u6bcf\u4e00\u4e2a\u6570 x，\u5bfb\u627e\u6570\u7ec4\u4e2d\u662f\u5426\u5b58\u5728 target – x\u3002<\/p>\n
\u5f53\u6211\u4eec\u4f7f\u7528\u904d\u5386\u6574\u4e2a\u6570\u7ec4\u7684\u65b9\u5f0f\u5bfb\u627e target – x \u65f6，\u9700\u8981\u6ce8\u610f\u5230\u6bcf\u4e00\u4e2a\u4f4d\u4e8e x \u4e4b\u524d\u7684\u5143\u7d20\u90fd\u5df2\u7ecf\u548c x \u5339\u914d\u8fc7，\u56e0\u6b64\u4e0d\u9700\u8981\u518d\u8fdb\u884c\u5339\u914d\u3002\u800c\u6bcf\u4e00\u4e2a\u5143\u7d20\u4e0d\u80fd\u88ab\u4f7f\u7528\u4e24\u6b21，\u6240\u4ee5\u6211\u4eec\u53ea\u9700\u8981\u5728 x \u540e\u9762\u7684\u5143\u7d20\u4e2d\u5bfb\u627e target – x\u3002<\/p>\n
class Solution {
\n public int[] twoSum(int[] nums, int target) {
\n int n = nums.length;
\n for (int i = 0; i < n; ++i) {
\n for (int j = i + 1; j < n; ++j) {
\n if (nums[i] + nums[j] == target) {
\n return new int[]{i, j};
\n }
\n }
\n }
\n return new int[0];
\n }
\n}<\/p>\n
\u54c8\u5e0c\u8868<\/p>\n
\u6ce8\u610f\u5230\u65b9\u6cd5\u4e00\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u8f83\u9ad8\u7684\u539f\u56e0\u662f\u5bfb\u627e target – x \u7684\u65f6\u95f4\u590d\u6742\u5ea6\u8fc7\u9ad8\u3002\u56e0\u6b64，\u6211\u4eec\u9700\u8981\u4e00\u79cd\u66f4\u4f18\u79c0\u7684\u65b9\u6cd5，\u80fd\u591f\u5feb\u901f\u5bfb\u627e\u6570\u7ec4\u4e2d\u662f\u5426\u5b58\u5728\u76ee\u6807\u5143\u7d20\u3002\u5982\u679c\u5b58\u5728，\u6211\u4eec\u9700\u8981\u627e\u51fa\u5b83\u7684\u7d22\u5f15\u3002<\/p>\n
\u4f7f\u7528\u54c8\u5e0c\u8868，\u53ef\u4ee5\u5c06\u5bfb\u627e target – x \u7684\u65f6\u95f4\u590d\u6742\u5ea6\u964d\u4f4e\u5230\u4ece O(N) \u964d\u4f4e\u5230 O(1)\u3002<\/p>\n
\u8fd9\u6837\u6211\u4eec\u521b\u5efa\u4e00\u4e2a\u54c8\u5e0c\u8868，\u5bf9\u4e8e\u6bcf\u4e00\u4e2a x，\u6211\u4eec\u9996\u5148\u67e5\u8be2\u54c8\u5e0c\u8868\u4e2d\u662f\u5426\u5b58\u5728 target – x，\u7136\u540e\u5c06 x \u63d2\u5165\u5230\u54c8\u5e0c\u8868\u4e2d，\u5373\u53ef\u4fdd\u8bc1\u4e0d\u4f1a\u8ba9 x \u548c\u81ea\u5df1\u5339\u914d\u3002<\/p>\n
class Solution {
\n public int[] twoSum(int[] nums, int target) {
\n \/\/ \u4f7f\u7528 HashMap \u5b58\u50a8 <\u503c, \u7d22\u5f15>
\n Map<Integer, Integer> map = new HashMap<>();<\/p>\n
for(int i = 0; i < nums.length; i++){
\n int complement = target – nums[i];<\/p>\n
\/\/ \u68c0\u67e5\u5dee\u503c\u662f\u5426\u5df2\u5b58\u5728
\n if(map.containsKey(complement)){
\n return new int[]{map.get(complement), i};
\n }<\/p>\n
\/\/ \u5c06\u5f53\u524d\u503c\u548c\u7d22\u5f15\u5b58\u5165 map
\n map.put(nums[i], i);
\n }<\/p>\n
return new int[2]; \/\/ \u9898\u76ee\u4fdd\u8bc1\u6709\u89e3
\n }
\n}<\/p>\n","protected":false},"excerpt":{"rendered":"
\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\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\u66b4\u529b\u89e3\u6cd501class Solution {public int[] twoSum(int[] nums, int target) {for(int i0 ; i<nums.length;i){if(index(nums,t<\/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":[2692,1813,427],"topic":[],"class_list":["post-66593","post","type-post","status-publish","format-standard","hentry","category-server","tag-leetcode","tag-1813","tag-427"],"yoast_head":"\n