Two Sum

LeetCode題目: 1. Two Sum

My solution:

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
let twoSum = function(nums, target) {
    nums = Object.entries(nums).sort((itemA,itemB)=>itemA[1]-itemB[1]);
    let left = 0, right = nums.length-1;
    while(left < right) {
        if(nums[left][1] + nums[right][1] < target) left++;
        else if(nums[left][1] + nums[right][1] > target) right--;
        else if(nums[left][1] + nums[right][1] === target) return [nums[left][0], nums[right][0]];
    }
};