Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Поиск чисел в массиве с определённой суммой
- */
- // линейная сложность
- function pairOfNumbers(arr, target) {
- const compl = {};
- let res;
- for (let i = 0; i < arr.length; i++) {
- let a = target - arr[i];
- if (a in compl) {
- res = [compl[a], i]
- }
- compl[arr[i]] = i;
- }
- return res
- }
- // Сложность O(n * n);
- function pairOfNumbers(nums, target) {
- let result = [];
- let stack = nums;
- let i = stack.length - 1;
- while (i > 0) {
- let num = stack.pop();
- stack.forEach((el, ii) => {
- if (num + el === target) result.push(ii, i);
- })
- i--;
- }
- return result;
- };
- console.log(pairOfNumbers([15, 10, 3, 7], 17))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement