LeetCode 1. Two Sum

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> a;
	for(int i=0,j=i+1;i<nums.size();)
	{
        if(nums[i]+nums[j]==target)
	    {
	     a.push_back(i);
         a.push_back(j);
	    break;
	    }
        j++;
	    if(j>=nums.size())
	    {
	         i++;
	         j=i+1;
         }   
	}
	return a;

    }
};