Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
baibaixiaoya
Python
提交
95db17ce
P
Python
项目概览
baibaixiaoya
/
Python
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Python
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
95db17ce
编写于
10月 26, 2020
作者:
S
Shabab Karim
提交者:
GitHub
10月 26, 2020
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Added two pointer solution for two sum problem (#3468)
上级
9eefe681
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
61 addition
and
0 deletion
+61
-0
other/two_pointer.py
other/two_pointer.py
+61
-0
未找到文件。
other/two_pointer.py
0 → 100644
浏览文件 @
95db17ce
"""
Given a sorted array of integers, return indices of the two numbers such
that they add up to a specific target using the two pointers technique.
You may assume that each input would have exactly one solution, and you
may not use the same element twice.
This is an alternative solution of the two-sum problem, which uses a
map to solve the problem. Hence can not solve the issue if there is a
constraint not use the same index twice. [1]
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
[1]: https://github.com/TheAlgorithms/Python/blob/master/other/two_sum.py
"""
from
__future__
import
annotations
def
two_pointer
(
nums
:
list
[
int
],
target
:
int
)
->
list
[
int
]:
"""
>>> two_pointer([2, 7, 11, 15], 9)
[0, 1]
>>> two_pointer([2, 7, 11, 15], 17)
[0, 3]
>>> two_pointer([2, 7, 11, 15], 18)
[1, 2]
>>> two_pointer([2, 7, 11, 15], 26)
[2, 3]
>>> two_pointer([1, 3, 3], 6)
[1, 2]
>>> two_pointer([2, 7, 11, 15], 8)
[]
>>> two_pointer([3 * i for i in range(10)], 19)
[]
>>> two_pointer([1, 2, 3], 6)
[]
"""
i
=
0
j
=
len
(
nums
)
-
1
while
i
<
j
:
if
nums
[
i
]
+
nums
[
j
]
==
target
:
return
[
i
,
j
]
elif
nums
[
i
]
+
nums
[
j
]
<
target
:
i
=
i
+
1
else
:
j
=
j
-
1
return
[]
if
__name__
==
"__main__"
:
import
doctest
doctest
.
testmod
()
print
(
f
"
{
two_pointer
([
2
,
7
,
11
,
15
],
9
)
=
}
"
)
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录