2. 程式人生 > >1. Two Sum - LeetCode

1. Two Sum - LeetCode

阿新 • • 發佈：2018-06-17
rip lB num 其他 思路 int href 簡單 integer

Question

1. Two Sum

技術分享圖片

Solution

思路很簡單這裏就不說了，下面貼了不同的幾個Java實現的時間與其他算法實現的時間的比較

這個是LeetCode的第一道題，也是我刷的第一道，剛一開始的Java實現

public int[] twoSum(int[] nums, int target) {
    boolean find = false;
    int targeti = -1, targetj = -1;
    for (int i = 0; i < nums.length; i++) {
        for (int j = 0; j < nums.length
 
; j++) {
            if (i == j) {
                continue;
            }
            if (nums[i] + nums[j] == target) {
                targeti = i;
                targetj = j;
                find = true;
                break;
            }
        }
        if (find) {
            break;
        }
    }
    return
 
 new int[]{targeti, targetj};
}

技術分享圖片

稍微改進一下

public int[] twoSum(int[] nums, int target) {
    boolean find = false;
    int targeti = -1, targetj = -1;
    for (int i = 0; i < nums.length - 1; i++) {
        for (int j = i + 1; j < nums.length; j++) {

            if (nums[i] + nums[j] == target) {
                targeti = i;
                targetj = j;
                find = true
 
;
                break;
            }
        }
        if (find) {
            break;
        }
    }
    return new int[]{targeti, targetj};
}

技術分享圖片

下面這個版本是在討論中看到的O(1)時間復雜度

public int[] twoSum3(int[] nums, int target) {
    int[] result = new int[2];
    Map<Integer, Integer> map = new HashMap<Integer, Integer>();
    for (int i = 0; i < nums.length; i++) {
        if (map.containsKey(target - nums[i])) {
            result[1] = i;
            result[0] = map.get(target - nums[i]);
            return result;
        }
        map.put(nums[i], i);
    }
    return result;
}

技術分享圖片

1. Two Sum - LeetCode

相關推薦

1. Two Sum - LeetCode

rip lB num 其他 思路 int href 簡單 integer Question 1. Two Sum Solution 思路很簡單這裏就不說了，下面貼了不同的幾個Java實現的時間與其他算法實現的時間的比較 這個是LeetCode的第一道題，也是我刷的第一道，

1. Two Sum[ 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 tha

1. Two Sum----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 tha

LeetCode #1 Two Sum

問題 code 後來 如果 默認 key-value 行存儲 方式 另一個 Given an array of integers, return indices of the two numbers such that they add up to a specific t

LeetCode 1. Two Sum （兩數之和）

ret desc rip twosum 關鍵點 earch pub ++ num Given an array of integers, return indices of the two numbers such that they add up to a specif

leetCode 1. Two Sum

size_t 反向 back 數組 rst 如果 end 分享 solution class Solution { public: vector<int> twoSum(vector<int>& nums, int target)

[LeetCode] 1 Two Sum

.cn des www. 時間復雜度 pre ret tco ++ rip 原題地址： https://leetcode.com/problems/two-sum/description/ 題目： Given an array of integers, return i

[leetcode] 1. Two Sum

example solution cau 簡單 應該 pub ecif span code Given an array of integers, return indices of the two numbers such that they add up to a sp

Leetcode -- 1. two sum

ice sum because integer pub class sta 索引 use Given an array of integers, return indices of the two numbers such that they add up to a spe

Leetcode:1-Two Sum

n) 一個 indices code dice ict cau nbsp hat Given an array of integers, return indices of the two numbers such that they add up to a specifi

LeetCode 1. Two Sum

所有 specific assume alloc hat put integer have each Given an array of integers, return indices of the two numbers such that they add up to

leetcode python 1.Two Sum

鍵值 log bsp int 遍歷 while 字典 div target 1 class Solution(object): 2 def twoSum(self, nums, target): 3 """ 4 :type

LeetCode Array Easy 1. Two Sum

ecif new length indices 等於 clas may tco C# Given an array of integers, return indices of the two numbers such that they add up to a speci

【LeetCode-數組篇】 1 Two Sum

求的值 ole return 兩個 new pub 提升自己 記憶 pan 1 前言 之所以開始刷 LeetCode 上的算法題，一是快面臨秋招，第二點是因為提升自己的編程能力，在博客上爭取每天刷 5 道左右的算法題，堅持兩個月，希望博友們監督。 這個系列打算用 C#

Leetcode 1. Two Sum (Easy)

[1] get add each cte ger ber amp desc Description Given an array of integers, return indices of the two numbers such that they add up to

LeetCode系列：1 Two Sum

Q：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 wou

[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 w

leetcode-algorithms-1 two sum

leetcode-algorithms-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 th

leetcode 1. Two Sum(兩數之和）

解題方案 思路 1 ******- 時間複雜度: O(N^2)******- 空間複雜度: O(1)****** 暴力解法，兩輪遍歷 beats 27.6% class Solution(object): def twoSum(self, nums, targe

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 wo