2. 程式人生 > >LeetCode:NO.1Two Sum

LeetCode:NO.1Two Sum

阿新 • • 發佈：2019-01-01

LeetCode:NO.1Two 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.

示例

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

程式碼（暴力實現 複雜度O(n^2)）

class Solution {
private:
    int target;

public:
    vector<int> twoSum(vector<int>& nums, int target) {
        for(int i = 0; i < nums.size(); i++)
        for(int j = i+1; j < nums.size(); j++){
            if(nums[i]+nums[j] == target){
                cout << i <<" "<< j<<endl;
                return vector<int> {i,j};
            }
        }
    }
};

執行結果

相關推薦

LeetCode:NO.1Two Sum

LeetCode:NO.1Two Sum 題目描述 Given an array of integers, return indices of the two numbers such that they add up to a specific target. You ma

leetcode#1Two Sum

size target 元素 stat sum 哈希表 code div 個數 給定一個整數數組和一個目標值，找出數組中和為目標值的兩個數。你可以假設每個輸入只對應一種答案，且同樣的元素不能被重復利用。 示例:給定 nums = [2, 7, 11, 15], targe

leetcode 363. Max Sum of Rectangle No Larger Than K

Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no la

LeetCode 001 Two Sum - Java

兩個 -s sof leet blog 個數 lee class ger Given an array of integers, return indices of the two numbers such that they add up to a specific t

[LeetCode] 40. Combination Sum II Java

array lec span mov ont integer target else list 題目： Given a collection of candidate numbers (C) and a target number (T), find all unique

[leetcode-494-Target Sum]

tco 都是 而是 明顯 isa 運行 ble oss original You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symb

[leetcode-377-Combination Sum IV]

一維數組 chang gin .html arr bin ces osi () Given an integer array with all positive numbers and no duplicates, find the number of possible c

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 113. Path Sum II 20170705 部分之前做了沒寫的題目

for list 路徑 父節點 leetcode pathsum and left -1 Given a binary tree and a sum, find all root-to-leaf paths where each path‘s sum equals the

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 39. Combination Sum

pop and highlight tar 如果 pub logs int 每一個 類似 二叉樹遍歷到根節點path，也類似深度優先搜索 首先保持一個result的vector<vector>，是引用類型。 聲明一個保持中間結果的vector，這個vec

LeetCode 15: 3 Sum

res leetcode sum turn arr pub new .so while public class Solution { public List<List<Integer>> threeSum(int[] nums) {

leetcode 001 Two Sum

返回 print pre free inpu public 組元 oid != 兩數之和。 給一個整數數組，返回兩個數組元素為特定值的數組元素索引。可以假定每個輸入都有且只有一個解，每個數組元素不能使用兩次。 例子： Given nums = [2, 7, 11, 15],

LeetCode - 307. Range Sum Query - Mutable

arr right fin 解決 dice div integer distrib anti Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j),

LeetCode 167. Two Sum II - Input array is sorted （兩數之和之二 - 輸入的是有序數組）

point find leetcode algorithm 個數 tar div solution runtime Given an array of integers that is already sorted in ascending order, find two

[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: Continuous Subarray Sum

我們 code == true view bool number fun 數組 Given a list of non-negative numbers and a target integer k, write a function to check if the ar

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