LeetCode-01兩數之和
阿新 • • 發佈:2018-12-03
class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> m; for (int i = 0; i < nums.size(); ++i) { if (m.count(target - nums[i])) { return {i, m[target - nums[i]]}; } m[nums[i]] = i; } return {}; } };
/** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* nums, int numsSize, int target) { int i,j,count=0; int *a = (int*)malloc(2*sizeof(int)); for (i=0;i<numsSize;i++) { for (j=i+1;j<numsSize;j++) { if(nums[i]+nums[j]==target) { a[0] = i; a[1] = j; count = 1; } if(count==1) break; } } return a; }
C++ 執行時間8ms;C執行時間108ms。