Giải bài 01 Two Sum O(N)

ltd · January 22, 2019, 6:06am

Đề bài:

https://leetcode.com/problems/two-sum/

Bài giải:

Code Python

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dic = dict()
        for i, num in enumerate(nums):
            x = target - num
            if x in dic:
                return dic[x], i
            dic[num] = i

Nhờ các bạn code với ngôn ngữ khác

anon12276517 · January 16, 2019, 10:53am

Java Code

class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> map = new HashMap();
        int[] output = null;
        for(int i = 0; i < nums.length; i++)
        {
            if(map.containsKey(target - nums[i]))
            {
                output =  new int[]{map.get(target - nums[i]),i};
                break;
            }
            else map.put(nums[i], i);
        }
        return output;      
    }
}

a_nguyen_van · January 23, 2019, 2:22pm

C++ code

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map< int , int > mp;
        for(int i = 0; i < nums.size(); ++i){
            int x = target - nums[i];
            if(mp.count(x)) return { i, mp[x] };
            mp[nums[i]] = i;
        }
        return { -1, -1 };
    }
};

Tinh_Thai_Son · January 23, 2019, 4:35pm

Php các bác nhẹ tay

class Solution {
    function twoSum($nums, $target) {
        $count=count($nums);
        for($i=0;$i<=$count-1;$i++){
            $so_2=$target-$nums[$i];
            $i_2=array_search($so_2,$nums);
            if($i_2){
                $result=array($i,$i_2);
                return $result;
            }
        }
    }
}