LeetCode： twosum

#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
    int *nums;
    int i, j, n, targe,a[2];
    cin >> n;
    nums = (int*)malloc(sizeof(int)*n);
    for (i = 0; i < n; i++)
    {
        cin >> nums[i];
    }
    cin >> targe;
    for (i = 0; i < n; i++)
    {
        for (j = i+1; j < n; j++)
        {
            if (nums[i] + nums[j] == targe)
            {
                a[0] = i;
                a[1] = j;
                cout <<"["<< a[0]<<","<<a[1]<<"]" << endl;
            }
        }

    }
    getchar(); getchar(); getchar(); getchar();
        return 0;
}