无序数组找出两数和等于目标数的索引

/**
  * 
  * @param numbers int整型一维数组 
  * @param target int整型 
  * @return int整型一维数组
  */
function twoSum( numbers ,  target ) {
    // write code here
    var arr = new Array();
    var n = numbers.length;
    for(var i = 0; i < n; i++)
    {
        var m = target - numbers[i];
        for(var j = i+1 ; j<n; j++)
        {
            if ( numbers[j] == m )
            {
                arr.push(i+1,j+1);
                return arr;            
            }
        }   
}
}
module.exports = {
    twoSum : twoSum
};