code every day with me

#javascript #programming #100daysofcode #algorithms

--DAY 20--

Hi, I am going to make #100DaysOfCode Challenge. Everyday I will try solve 1 problem from leetcode or hackerrank. Hope you can go with me until end.
Now let's solve problem today:
Problem: Two Sum II
Detail: here
My solution(javascript):

var twoSum = function(numbers, target) {
    let i=0,j=numbers.length-1;
    while(i<j){
        if(numbers[i]+numbers[j]==target){
            return [i+1,j+1];
        }
        else if (numbers[i] + numbers[j] < target)
            i++;
        else
            j--;
    }
};

-->If you have better solution or any question, please comment below. I will appreciate.

Top comments (5)

korzo • Nov 17 '21

You should cache the addition.
I ended up with this solution, but apparently it's slower (as long as runtime is reliable).

var twoSum = function(numbers, target) {
    let i = 0, j = numbers.length - 1, sum;

    while ((sum = numbers[i] + numbers[j]) !== target) {
        sum > target ? j-- : i++;
    }

    return [i + 1, j + 1];
};