update

Author: siria55

.elp

@@ -22,5 +22,8 @@
   [680]
 },
 20221104={
-  []
+  [524]
+},
+20221107={
+  [167]
 }

0167_Two_Sum_II_-_Input_array_is_sorted/Solution2.cpp

@@ -1,52 +1,13 @@
-#include <cstdio>
-#include <string>
-#include <vector>
-using namespace std;
-
 class Solution {
 public:
     vector<int> twoSum(vector<int>& numbers, int target) {
         int l = 0, r = numbers.size() - 1;
         while (l < r) {
-            int sum = numbers[l] + numbers[r];
-            if (sum < target)
-                ++l;
-            else if (sum > target)
-                --r;
-            else
-                return {l+1, r+1};
+            int s = numbers[l] + numbers[r];
+            if (s < target) ++l;
+            else if (s > target) --r;
+            else return {l+1, r+1};
         }
-        return {-1, -1};
+        return {};
     }
-};
-
-
-void test(string test_name,
-          vector<int>& numbers,
-          int target,
-          const vector<int>& expected) {
-    vector<int> res = Solution().twoSum(numbers, target);
-    if (res == expected)
-        printf("%s succeed\n", test_name.c_str());
-    else
-        printf("%s fail\n", test_name.c_str());
-}
-
-int main() {
-    vector<int> numbers1{2,7,11,15};
-    int target1 = 9;
-    vector<int> expected1{1,2};
-    test("test1", numbers1, target1, expected1);
-
-    vector<int> numbers2{2,3,4};
-    int target2 = 6;
-    vector<int> expected2{1,3};
-    test("test2", numbers2, target2, expected2);
-
-    vector<int> numbers3{-1, 0};
-    int target3 = -1;
-    vector<int> expected3{1,2};
-    test("test3", numbers3, target3, expected3);
-
-    return 0;
-}
+};

0167_Two_Sum_II_-_Input_array_is_sorted/Solution2.js

@@ -1,43 +1,14 @@
-import { ArrayUtils } from './util_js/array.js';
-
 /**
  * @param {number[]} numbers
  * @param {number} target
  * @return {number[]}
  */
-var twoSum = function(numbers, target) {
-  let l = 0, r = numbers.length - 1;
+ var twoSum = function(numbers, target) {
+  let l = 0, r = numbers.length-1;
   while (l < r) {
     let s = numbers[l] + numbers[r];
-    if (s < target)
-      ++l;
-    else if (s > target)
-      --r;
-    else
-      return [l+1, r+1];
+    if (s < target) ++l;
+    else if (s > target) --r;
+    else return [l+1, r+1];
   }
-  return [];
 };
-
-function test(test_name, numbers, target, expected) {
-  let res = twoSum(numbers, target);
-  if (ArrayUtils.isEqualArray(res, expected))
-    console.log(test_name + ' succeed');
-  else
-    console.log(test_name + ' fail');
-}
-
-let numbers1 = [2,7,11,15];
-let target1 = 9;
-let expected1 = [1,2];
-test('test1', numbers1, target1, expected1);
-
-let numbers2 = [2,3,4];
-let target2 = 6;
-let expected2 = [1,3];
-test('test2', numbers2, target2, expected2);
-
-let numbers3 = [-1, 0];
-let target3 = -1;
-let expected3 = [1,2];
-test('test3', numbers3, target3, expected3);

t.cpp

@@ -1,20 +1,13 @@
 class Solution {
-    bool isSubsequence(string word, string s) {
-        int pw = 0, size = s.size();
-        for (int ps = 0; ps < size; ++ps)
-            if (word[pw] == s[ps]) ++pw;
-        return pw == word.size();
-    }
 public:
-    string findLongestWord(string s, vector<string>& dictionary) {
-        string res = "";
-        for (const string& word : dictionary) {
-            if (!isSubsequence(word, s))
-                continue;
-            if (res.size() < word.size() ||
-                    res.size() == word.size() && word < res)
-                res = word;
+    vector<int> twoSum(vector<int>& numbers, int target) {
+        int l = 0, r = numbers.size() - 1;
+        while (l < r) {
+            int s = numbers[l] + numbers[r];
+            if (s < target) ++l;
+            else if (s > target) --r;
+            else return {l+1, r+1};
         }
-        return res;
+        return {};
     }
-};
+};

t.js

@@ -1,22 +1,15 @@
 /**
- * @param {string} s
- * @param {string[]} dictionary
- * @return {string}
+ * @param {number[]} numbers
+ * @param {number} target
+ * @return {number[]}
  */
-var findLongestWord = function(s, dictionary) {
-  function isSubsequence(word, s) {
-    let pw = 0;
-    for (let ps = 0; ps < s.length; ++ps)
-      if (word[pw] === s[ps]) ++pw;
-    return pw === word.length;
+var twoSum = function(numbers, target) {
+  let l = 0, r = numbers.length-1;
+  while (l < r) {
+    let s = numbers[l] + numbers[r];
+    if (s < target) ++l;
+    else if (s > target) --r;
+    else return [l+1, r+1];
   }
-
-  let res = '';
-  for (let word of dictionary) {
-    if (!isSubsequence(word, s))
-      continue;
-    if (res.length < word.length || (res.length === word.length && word < res))
-      res = word;
-  }
-  return res;
 };
+