Archive
LeetCode - Two Sum
class Solution { public: vector twoSum(vector& nums, int target) { vector answer (2); unsigned int length = nums.size(); for(int i = 0 ; i < length; i++) { unsigned int left = nums.at(i); for(int j = i+1 ; j < length; j++) { if((left + nums[j]) == target) { //answer.push_back(i); //answer.push_back(j); answer[0] = i; answer[1] = j; } } } return answer; } }; push_back 하면 런타임이 조금 더 걸림. (0.1초 정도?) ..
