zoukankan      html  css  js  c++  java
  • 19.1.11 LeetCode 1. Two Sum

    Given an array of integers, return indices of the two numbers such that they add up to a specific target.

    You may assume that each input would have exactly one solution, and you may not use the same element twice.

    Example:

    Given nums = [2, 7, 11, 15], target = 9,
    
    Because nums[0] + nums[1] = 2 + 7 = 9,
    return [0, 1].
     1 class Solution {
     2 public:
     3     vector<int> twoSum(vector<int>& nums, int target) {
     4         map<int, int>hash;
     5         for (int i = 0; i < nums.size(); i++)
     6         {
     7             hash[target - nums[i]] = nums[i];
     8             if (hash.find(nums[i])!=hash.end()) {
     9                 for (int j = 0; j < i; j++)
    10                     if (nums[i] + nums[j] == target)
    11                         return vector<int>{j, i};
    12             }
    13         }
    14     }
    15 };
    View Code

    是哈希表啊!

    一开始想用排序二分,没有想到用哈希呢。

    注定失败的战争,也要拼尽全力去打赢它; 就算输,也要输得足够漂亮。
  • 相关阅读:
    【脑图】iOS的Crash分类和捕获
    Ruby03
    Ruby02
    Ruby01
    如何快速把一个十进制数转换为二进制?
    iOS
    互联网协议基本知识
    XCBB
    iOS
    iOS
  • 原文地址:https://www.cnblogs.com/yalphait/p/10254814.html
Copyright © 2011-2022 走看看