allpeople-financial-independence

|----
  |---- algorithm          // 
    |---- leetcode         // LeetCode 
    |---- others           // 
  |---- interview          // 
    |---- JavaScript       // JS 
    |---- CSS              // CSS 
    |---- HTML             // HTML 

/algorithm/leetcode/01_.js

/**
 * @title 
 * @link https://leetcode.cn/problems/two-sum/
 * @param {Array} nums 
 * @param {number} target 
 */
// ==================================  =========================== //
/**
 * @author luffyZh
 * @leetcode https://leetcode.cn/problems/two-sum/solution/by-luffyzh-36o9/
 * @description  O(n2) 
 * for key value 
 *  target - nums[i]  temp 
 *  temp 
 * 
 *  temp[target - nums[i]] 0 typeof temp[target - nums[i]] !== 'undefined'
 */
var twoSum_luffyZh = function(nums, target) {
  var temp = {};
  for (let i = 0; i < nums.length; i++) {
      var left = target - nums[i];
      if (typeof temp[left] !== 'undefined') {
          console.log([temp[right], i]);
          return [temp[right], i];
      }
      temp[nums[i]] = i;
  }
};

twoSum_luffyZh([2,7,11,15], 9);

/**
 * 
 */

PR /interview/JavaScript/20230116_ ****