No1.Two Sum
来源:互联网 发布:淘宝新赛欧改折叠钥匙 编辑:程序博客网 时间:2024/06/06 02:23
/* Two Sum Total Accepted: 114575 Total Submissions: 647786 My Submissions Question Solution Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.You may assume that each input would have exactly one solution.Input: numbers={2, 7, 11, 15}, target=9Output: index1=1, index2=2 */ /*以空间换时间*/ class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector <int> test(65536,-1);vector<int> resultIndex; int another; for(int j =nums.size()-1;j>=0;j--) //O(N) { test.at(hash(nums.at(j))) = j; } for(int i=0;i<nums.size();i++) //O(N) { another = target - nums.at(i); int maybeIndex =test.at(hash(another)); if(maybeIndex >=0 && maybeIndex!=i) { resultIndex.push_back(maybeIndex+1); resultIndex.push_back(i+1); break; } } if (resultIndex[0]>resultIndex[1]){resultIndex[0] = resultIndex[0] ^ resultIndex[1];resultIndex[1] = resultIndex[0] ^ resultIndex[1];resultIndex[0] = resultIndex[0] ^ resultIndex[1];} return resultIndex; } int hash(int input) { if(input<0) { return 32767-input; }else { return input; } } };
0 0
- No1.Two Sum
- leetcode No1. Two Sum
- LeetCode : No1 Two Sum Python
- LeetCode Problem No1 Two Sum
- 【LeetCode从零单排(Java)】No1.Two Sum
- NO1:SQL语句(sum,decode)
- No1
- NO1
- No1
- NO1
- NO1
- NO1
- no1
- Two Sum
- Two Sum
- Two Sum
- two sum
- Two Sum
- Hbase和Oracle的对比
- hdu3308LCIS 线段树
- iOS 中KVC、KVO、NSNotification、delegate 总结及区别
- equals与==之间的区别
- JAVA设计模式之观察者模式
- No1.Two Sum
- Session 和Cookie的区别
- Makefile的call函数
- 面向对象
- java 获取泛型的类型
- 经典迷宫问题
- 关于ConcurrentHashMap
- 用Eclipse进行Java web开发时,错误:HttpServlet was not found on the Java
- HDU 1495 非常可乐(隐式图的遍历)