问题描述:已排序(升序)数组为A[n],找出数组中是否存在两数之和为给定的的X
解决:
(1)定义指针p=A[0],r=A[n-1]
(2)判断p+r是否等于X:
若等于,则找到
若p+r>X 则r往前移一格
若p+r<X则p往后移一位
(3)重复(2)直到找到或者p>r停止
用python模拟了下,为什么用python,今天看到一句话:life is too short ,use python!
import random
r=int(raw_input("input the sum x:"))
n=int(raw_input("input the length n of the arry:"))
arry=[]
for i in range(1,n+1):
s=random.randint(1,100)
arry.append(s)
arry.sort()
print arry
print ''
x=0
y=n-1
flag=True
times=0
while x<=y:
if arry[x]+arry[y]==r:
print 'arry[',x,']:',arry[x],'+ arry[',y,']:',arry[y],'=',r,',times=',times
flag=False
break
elif arry[x]+arry[y]>r:
y=y-1
times=times+1
else:
x=x+1
times=times+1
if flag:
print 'No two num\'s sum is the',r