leetcode两数之和求所有的组合

题目：
给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。

思路：
1.从第一个位置起，尝试其他位置和1的组合。完成以后，再从第二个位置开始，分别从第 3到第n进行组合尝试。也就是两个for循环，外层从0开始到n-1.内循环从外层循环当前位置加1开始进行遍历。

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
          int i,j ,n=sizeof(nums) / sizeof(nums[0]);
          for(i=0;i<n;i++)
          	for(j=i+1;j<n;j++)
          	{
          		if(nums[i]+nums[j]==target)                        				  	
                                  return {i,j};
          	}
          return {i,j};
  }
 };

提交时出现了错误

29ERROR: AddressSanitizer: heap-buffer-overflow on address 0x60200000011c at pc 0x0000004056bc bp 0x7fff5c7e01d0 sp 0x7fff5c7e01c8
READ of size 4 at 0x60200000011c thread T0
#1 0x7ff014dde2e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)
0x60200000011c is located 0 bytes to the right of 12-byte region [0x602000000110,0x60200000011c)
allocated by thread T0 here:
#0 0x7ff016a20ce0 in operator new(unsigned long) (/usr/local/lib64/libasan.so.5+0xe9ce0)
#5 0x7ff014dde2e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)
Shadow bytes around the buggy address:
0x0c047fff7fd0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x0c047fff7fe0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x0c047fff7ff0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x0c047fff8000: fa fa fd fa fa fa fd fa fa fa fd fd fa fa fd fa
0x0c047fff8010: fa fa fd fa fa fa fd fa fa fa fd fa fa fa fd fa
=>0x0c047fff8020: fa fa 00[04]fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8030: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8040: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8050: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8060: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8070: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
Shadow byte legend (one shadow byte represents 8 application bytes):
Addressable: 00
Partially addressable: 01 02 03 04 05 06 07
Heap left redzone: fa
Freed heap region: fd
Stack left redzone: f1
Stack mid redzone: f2
Stack right redzone: f3
Stack after return: f5
Stack use after scope: f8
Global redzone: f9
Global init order: f6
Poisoned by user: f7
Container overflow: fc
Array cookie: ac
Intra object redzone: bb
ASan internal: fe
Left alloca redzone: ca
Right alloca redzone: cb
29ABORTING

反思
根据错误提示估计为缓存站溢出，应该是这种暴力解法导致的，时间复杂度为O(n^2)