From a4d83dcb32e193446988a534aafcb7af7e0fc78b Mon Sep 17 00:00:00 2001
From: Temitope Agbaje <agbajeinioluwa@gmail.com>
Date: Sat, 8 Oct 2022 08:42:13 +0100
Subject: [PATCH 1/2] Add another method to 2sum Problem
---
 LeetcodeProblems/Algorithms/2Sum.js &#124; 28 +++++++++++------
 LeetcodeProblemsTests/Algorithms/2Sum_Test.js &#124; 6 ++--
 .../Algorithms/3Sum_Closest_Test.js &#124; 10 +++---
 LeetcodeProblemsTests/Algorithms/3Sum_Test.js &#124; 21 ++++++-------
 .../Algorithms/Add_Two_Numbers_Test.js &#124; 7 ++---
 .../Algorithms/Award_Budget_Cuts_Test.js &#124; 4 +--
 Test.js &#124; 31 ++++++++++++-------
 7 files changed, 61 insertions(+), 46 deletions(-)
diff --git a/LeetcodeProblems/Algorithms/2Sum.js b/LeetcodeProblems/Algorithms/2Sum.js
index 44df5cd..a4b6373 100644
--- a/LeetcodeProblems/Algorithms/2Sum.js
+++ b/LeetcodeProblems/Algorithms/2Sum.js
@@ -28,16 +28,26 @@ Output: [0,1]
 * @param {number} target
 * @return {number[]}
 */
- var twoSum = function(nums, target) {
- let map ={};
- for(let i=0;i<nums.length;i++){ - const sum = target-nums[i]; - if(map[parseInt(sum)] != 0){ - return [map[sum], i]; - } else{ - map[nums[i]] = i; +var twoSum = function (nums, target) { + let map = {}; + for (let i = 0; i < nums.length; i++) { + const sum = target - nums[i]; + if (map[parseInt(sum)] != 0) { + return [map[sum], i]; + } else { + map[nums[i]] = i; + } + } + + //Another method + + for (let i = 0; i < nums.length; i++) { + for (let j = i + 1; j < nums.length; i++) { + if (nums[1] + nums[j] === target) { + return [i, j]; } + } } }; -module.exports.twoSum = twoSum; \ No newline at end of file +module.exports.twoSum = twoSum; diff --git a/LeetcodeProblemsTests/Algorithms/2Sum_Test.js b/LeetcodeProblemsTests/Algorithms/2Sum_Test.js index 2ec1aad..ced9e42 100644 --- a/LeetcodeProblemsTests/Algorithms/2Sum_Test.js +++ b/LeetcodeProblemsTests/Algorithms/2Sum_Test.js @@ -1,11 +1,11 @@ -const assert = require('assert'); -const twoSum = require('../../LeetcodeProblems/Algorithms/2Sum').twoSum; +const assert = require("assert"); +const twoSum = require("../../LeetcodeProblems/Algorithms/2Sum").twoSum; var test = function () { assert.deepEqual([0,1], twoSum([2,7,11,15], 9)); assert.deepEqual([1,2], twoSum([3,2,4], 6)); assert.deepEqual([0,1], twoSum([3,3], 6)); -} +}; module.exports.test = test; diff --git a/LeetcodeProblemsTests/Algorithms/3Sum_Closest_Test.js b/LeetcodeProblemsTests/Algorithms/3Sum_Closest_Test.js index af8e630..5d397ad 100644 --- a/LeetcodeProblemsTests/Algorithms/3Sum_Closest_Test.js +++ b/LeetcodeProblemsTests/Algorithms/3Sum_Closest_Test.js @@ -1,10 +1,10 @@ -const assert = require('assert'); -const threeSumClosest = require('../../LeetcodeProblems/Algorithms/3SumClosest').threeSumClosest; +const assert = require("assert"); +const threeSumClosest = + require("../../LeetcodeProblems/Algorithms/3SumClosest").threeSumClosest; var test = function () { - assert.equal(2, threeSumClosest([-1, 2 , 1, -4], 1)); + assert.equal(2, threeSumClosest([-1, 2, 1, -4], 1)); assert.equal(0, threeSumClosest([0, 0, 0], 1)); - -} +}; module.exports.test = test; diff --git a/LeetcodeProblemsTests/Algorithms/3Sum_Test.js b/LeetcodeProblemsTests/Algorithms/3Sum_Test.js index cee1910..4dd352c 100644 --- a/LeetcodeProblemsTests/Algorithms/3Sum_Test.js +++ b/LeetcodeProblemsTests/Algorithms/3Sum_Test.js @@ -1,22 +1,19 @@ -const assert = require('assert'); -const threeSum = require('../../LeetcodeProblems/Algorithms/3Sum').threeSum; +const assert = require("assert"); +const threeSum = require("../../LeetcodeProblems/Algorithms/3Sum").threeSum; var test = function () { assert.deepEqual(threeSum([]), []); assert.deepEqual(threeSum([0]), []); assert.deepEqual(threeSum([0, 0]), []); + assert.deepEqual(threeSum([0, 0, 0]), [[0, 0, 0]]); assert.deepEqual( - threeSum([0, 0, 0]), + threeSum([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]), [[0, 0, 0]] ); - assert.deepEqual( - threeSum([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]), - [[0, 0, 0]] - ); - assert.deepEqual( - threeSum([-1, 0, 1, 2, -1, -4]), - [ [ -1, 2, -1 ], [ 0, 1, -1 ] ] - ); -} + assert.deepEqual(threeSum([-1, 0, 1, 2, -1, -4]), [ + [-1, 2, -1], + [0, 1, -1], + ]); +}; module.exports.test = test; diff --git a/LeetcodeProblemsTests/Algorithms/Add_Two_Numbers_Test.js b/LeetcodeProblemsTests/Algorithms/Add_Two_Numbers_Test.js index 82f8168..5af6f69 100644 --- a/LeetcodeProblemsTests/Algorithms/Add_Two_Numbers_Test.js +++ b/LeetcodeProblemsTests/Algorithms/Add_Two_Numbers_Test.js @@ -1,7 +1,6 @@ -const assert = require('assert'); -const addTwoNumbers = require('../../LeetcodeProblems/Algorithms/Add_Two_Numbers').addTwoNumbers; -const ListNodeTestHelper = require('../../UtilsClasses/ListNodeTestHelper'); -var ListNode = require('../../UtilsClasses/ListNode').ListNode; +const addTwoNumbers = require("../../LeetcodeProblems/Algorithms/Add_Two_Numbers").addTwoNumbers; +const ListNodeTestHelper = require("../../UtilsClasses/ListNodeTestHelper"); +var ListNode = require("../../UtilsClasses/ListNode").ListNode; function test() { const list1 = ListNode.linkenList([1,2,3,4]); diff --git a/LeetcodeProblemsTests/Algorithms/Award_Budget_Cuts_Test.js b/LeetcodeProblemsTests/Algorithms/Award_Budget_Cuts_Test.js index 93f1c07..2dacf4a 100644 --- a/LeetcodeProblemsTests/Algorithms/Award_Budget_Cuts_Test.js +++ b/LeetcodeProblemsTests/Algorithms/Award_Budget_Cuts_Test.js @@ -1,5 +1,5 @@ -const assert = require('assert'); -const cutAwardBadges = require('../../LeetcodeProblems/Algorithms/Award_Budget_Cuts').cutAwardBadges; +const assert = require("assert"); +const cutAwardBadges = require("../../LeetcodeProblems/Algorithms/Award_Budget_Cuts").cutAwardBadges; function test() { assert.deepEqual( diff --git a/Test.js b/Test.js index 3b5c27f..185ebe3 100644 --- a/Test.js +++ b/Test.js @@ -1,26 +1,33 @@ -const fs = require('fs'); +/* eslint-disable no-useless-escape */ +/* eslint-disable no-undef */ +const fs = require("fs"); -const TESTS_FOLDER = './LeetcodeProblemsTests/Algorithms/'; +const TESTS_FOLDER = "./LeetcodeProblemsTests/Algorithms/"; const REGEX_PATTERN_HIDDEN_FILES = /(^&#124;\/)\.[^\/\.]/g; -var test_all = async function() { +var test_all = async function () { try { const problems = await loadProblems(); - for(i in problems) { + for (i in problems) { console.log("Solving: " + problems[i]); const problem = require(TESTS_FOLDER + problems[i]); - if (typeof(problem.test) !=='undefined') { + if (typeof problem.test !== "undefined") { problem.test(); console.log("✅ Tests for " + problems[i] + " run successfully \n"); } else { - console.warn(problem, "🔴 The problem " + problems[i] + " doesn't have a test method implemented.\n"); - } + console.warn( + problem, + "🔴 The problem " + + problems[i] + + " doesn't have a test method implemented.\n" + ); + } } } catch (error) { throw new Error(error); } -} +}; var loadProblems = () => {
 return new Promise(function (resolve, reject) {
@@ -28,11 +35,13 @@ var loadProblems = () => {
 if (error) {
 reject(error);
 } else {
- problems = files.filter(item => !(REGEX_PATTERN_HIDDEN_FILES).test(item));
+ problems = files.filter(
+ (item) => !REGEX_PATTERN_HIDDEN_FILES.test(item)
+ );
 resolve(problems);
 }
- })
+ });
 });
-}
+};
 
 test_all();
From 82df19652de5c1be75ae285e40344178393ff5db Mon Sep 17 00:00:00 2001
From: Temitope Agbaje <agbajeinioluwa@gmail.com>
Date: Sat, 8 Oct 2022 20:21:53 +0100
Subject: [PATCH 2/2] updated 2sum
---
 LeetcodeProblems/Algorithms/2Sum.js &#124; 6 ++++--
 LeetcodeProblemsTests/Algorithms/2Sum_Test.js &#124; 8 ++++++++
 2 files changed, 12 insertions(+), 2 deletions(-)
diff --git a/LeetcodeProblems/Algorithms/2Sum.js b/LeetcodeProblems/Algorithms/2Sum.js
index a4b6373..11e7606 100644
--- a/LeetcodeProblems/Algorithms/2Sum.js
+++ b/LeetcodeProblems/Algorithms/2Sum.js
@@ -38,9 +38,10 @@ var twoSum = function (nums, target) {
 map[nums[i]] = i;
 }
 }
+};
 
- //Another method
-
+//Another method
+var twoSum2 = function (nums, target) {
 for (let i = 0; i < nums.length; i++) {
 for (let j = i + 1; j < nums.length; i++) {
 if (nums[1] + nums[j] === target) {
@@ -51,3 +52,4 @@ var twoSum = function (nums, target) {
 };
 
 module.exports.twoSum = twoSum;
+module.exports.twoSum2 = twoSum2;
diff --git a/LeetcodeProblemsTests/Algorithms/2Sum_Test.js b/LeetcodeProblemsTests/Algorithms/2Sum_Test.js
index ced9e42..1cf3897 100644
--- a/LeetcodeProblemsTests/Algorithms/2Sum_Test.js
+++ b/LeetcodeProblemsTests/Algorithms/2Sum_Test.js
@@ -1,5 +1,6 @@
 const assert = require("assert");
 const twoSum = require("../../LeetcodeProblems/Algorithms/2Sum").twoSum;
+const twoSum2 = require("../../LeetcodeProblems/Algorithms/2Sum").twoSum2;
 
 var test = function () {
 assert.deepEqual([0,1], twoSum([2,7,11,15], 9));
@@ -7,5 +8,12 @@ var test = function () {
 assert.deepEqual([0,1], twoSum([3,3], 6));
 };
 
+var test2 = function () {
+ assert.deepEqual([0,1], twoSum2([2,7,11,15], 9));
+ assert.deepEqual([1,2], twoSum2([3,2,4], 6));
+ assert.deepEqual([0,1], twoSum2([3,3], 6));
+};
+
 module.exports.test = test;
+module.exports.test2 = test2;
 
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/ignacio-chiazzo/Algorithms-Leetcode-Javascript/pull/60.patch">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/ignacio-chiazzo/Algorithms-Leetcode-Javascript/pull/60.patch" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>