Two Sum

学习

Created At : 2025-03-22 19:29

Views 👀 :

My Attempt Solution1:
My Attempt Solution2:
My Final Solution:

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

My Attempt Solution1:

拿到题目, 我以为很简单, 所以在手机上直接敲代码, 第一次的程序如下, 结果Time Limit Exceeded:

var twoSum = function (numbers, target) {
    var i = 0, j = i + 1

    while (1) {
        var temp = numbers[i] + numbers[j]

        if (temp < target) {
            j = j + 1
            continue
        }
        if (temp > target) {
            i = i + 1
            j = i + 1
            continue;
        }

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

var target = 16021;

console.log(twoSum(numbers, target));

接下来需要深入理解题意, 感觉连答案都错了.

My Attempt Solution2:

为了提高速度, 在进入逻辑前进行数组的排序, 结果 Wrong Answer:

var twoSum = function (numbers, target) {

    var i = 0, j = i + 1;

    numbers.sort();

    while (1) {
        var temp = numbers[i] + numbers[j];

        if (temp < target) {
            j = j + 1;
            continue;
        }
        if (temp > target) {
            i = i + 1;
            j = i + 1;
            continue;
        }

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

var numbers = [3,2,4]
var target = 6;

var start = new Date().getTime();
var result = twoSum(numbers, target);
var cost = new Date().getTime() - start;
console.log(cost);

console.log(result);

My Final Solution:

中间还错了好几次, 还要考虑数据是负数的情况:

var twoSum = function (numbers, target) {

    var i = 0, j = numbers.length - 1;

    var newNumbers = [];

    for (var k = 0; k < numbers.length; k++) {
        newNumbers.push([numbers[k], k]);
    }

    newNumbers.sort(function (a, b) {
                return a[0] - b[0];
            }
    );

    while (1) {
        var temp = newNumbers[i][0] + newNumbers[j][0];

        if (temp < target) {
            i++;
            continue;
        }

        if (temp > target) {
            j--;
            continue;
        }

        return [newNumbers[i][1] + 1, newNumbers[j][1] + 1].sort(function (a, b) {
            return a - b;
        });
    }
};

var numbers = [572, 815, 387, 418, 434, 530, 376, 190, 196, 74, 830, 561, 973, 771, 640, 37, 539, 369, 327, 51, 623, 575, 988, 44, 659, 48, 22, 776, 487, 873, 486, 169, 499, 82, 128, 31, 386, 691, 553, 848, 968, 874, 692, 404, 463, 285, 745, 631, 304, 271, 40, 921, 733, 56, 883, 517, 99, 580, 55, 81, 232, 971, 561, 683, 806, 994, 823, 219, 315, 564, 997, 976, 158, 208, 851, 206, 101, 989, 542, 985, 940, 116, 153, 47, 806, 944, 337, 903, 712, 138, 236, 777, 630, 912, 22, 140, 525, 270, 997, 763, 812, 597, 806, 423, 869, 926, 344, 494, 858, 519, 389, 627, 517, 964, 74, 432, 730, 843, 673, 985, 819, 397, 607, 34, 948, 648, 43, 212, 950, 235, 995, 76, 439, 614, 203, 313, 180, 760, 210, 813, 920, 229, 615, 730, 359, 863, 678, 43, 293, 978, 305, 106, 797, 769, 3, 700, 945, 135, 430, 965, 762, 479, 152, 121, 935, 809, 101, 271, 428, 608, 8, 983, 758, 662, 755, 190, 632, 792, 789, 174, 869, 622, 885, 626, 310, 128, 233, 82, 223, 339, 771, 741, 227, 131, 85, 51, 361, 343, 641, 568, 922, 145, 256, 177, 329, 959, 991, 293, 850, 858, 76, 291, 134, 254, 956, 971, 718, 391, 336, 899, 206, 642, 254, 851, 274, 239, 538, 418, 21, 232, 706, 275, 615, 568, 714, 234, 567, 994, 368, 54, 744, 498, 380, 594, 415, 286, 260, 582, 522, 795, 261, 437, 292, 887, 405, 293, 946, 678, 686, 682, 501, 238, 245, 380, 218, 591, 722, 519, 770, 359, 340, 215, 151, 368, 356, 795, 91, 250, 413, 970, 37, 941, 356, 648, 594, 513, 484, 364, 484, 909, 292, 501, 59, 982, 686, 827, 461, 60, 557, 178, 952, 218, 634, 785, 251, 290, 156, 300, 711, 322, 570, 820, 191, 755, 429, 950, 18, 917, 905, 905, 126, 790, 638, 94, 857, 235, 889, 611, 605, 203, 859, 749, 874, 530, 727, 764, 197, 537, 951, 919, 24, 341, 334, 505, 796, 619, 492, 295, 380, 128, 533, 600, 160, 51, 249, 5, 837, 905, 747, 505, 82, 158, 687, 507, 339, 575, 206, 28, 29, 91, 459, 118, 284, 995, 544, 3, 154, 89, 840, 364, 682, 700, 143, 173, 216, 290, 733, 525, 399, 574, 693, 500, 189, 590, 529, 972, 378, 299, 461, 866, 326, 43, 711, 460, 426, 947, 391, 536, 26, 579, 304, 852, 158, 621, 683, 901, 237, 22, 225, 59, 52, 798, 262, 754, 649, 504, 861, 472, 480, 570, 347, 891, 956, 347, 31, 784, 581, 668, 127, 628, 962, 698, 191, 313, 714, 893];
var target = 101;

var start = new Date().getTime();
var result = twoSum(numbers, target);
var cost = new Date().getTime() - start;

console.log(cost);

console.log(result);

转载请注明来源，欢迎对文章中的引用来源进行考证，欢迎指出任何有错误或不够清晰的表达。可以在下面评论区评论，也可以邮件至 jaytp@qq.com