167.[LeetCode]Two SumII
来源:互联网 发布:md5加密Java应用 密钥 编辑:程序博客网 时间:2024/06/04 19:49
这道题要是用哈希的话,时间复杂度也是 O(n),但是也可以不适用额外空间达到O(n),也是我们经常适用的方法,双指针法
// 这个是金典的 两数和 的问题,如何在o(n)的时间复杂度内完成呢?public class Solution { public int[] twoSum(int[] numbers, int target) { int[] an = new int[2]; int size = numbers.length; int index1 = 0; int index2 = size-1; int sum; while(index1 < index2){ sum = numbers[index1]+numbers[index2]; if(sum > target){ index2--; } else if(sum < target){ index1++; } else { break; } } an[0] = index1+1; an[1] = index2+1; return an; }}
0 0
- 167.[LeetCode]Two SumII
- leetcode(E)two sumII
- leetcode167 Two SumII java
- leetcode01. Two SumII
- LeetCode 113 Path SumII
- Leetcode dfs Combination SumII
- Leetcode dfs Path SumII
- leetcode c++ combination sumII
- Path SumII|leetcode题解
- LeetCode 040 Combination SumII
- Leetcode之Combination SumII
- [leetcode] Combination Sum and Combination SumII
- Leetcode题集——combination-sum and combination-sumII
- LeetCode-167. Two Sum II
- leetcode 167. Two Sum II
- [leetcode]167. Two Sum II
- leetcode 167. Two Sum II
- leetcode 167. Two Sum II
- HTTP 协议详解
- zookeeper技术浅析
- EasyDarwin开源流媒体服务器支持basic基本认证和digest摘要自定义认证
- 高精度加减乘除
- Android extsd open failed: EACCES (Permission denied)
- 167.[LeetCode]Two SumII
- 面试题1
- XIB之显示在控制台中的冲突约束
- NHibernate不支持复杂的linq,就一定要用DataTable这么低级吗
- QsAmQ
- 即时定位与地图构建(SLAM)的相关研究
- Wildcard Matching
- 继承与多态
- uva10791 Minimum Sum LCM