问题描述:
给出一个数组,在数组中找到2个数,使得它们的和最接近但不超过目标值,返回它们的和。
问题实例:
输入target = 15,array= [1,3,5,11,7],输出14,11+3=14,输入target=16和array=[1,3,5,11,7],输出16,11+5=16
#代码实现
class Solution:
def __init__(self,array,target):
self.array = array
self.target = target
self.T_F = False
self.num_list = []
self.num_list.append(self.target)
self.font = 0
self.font_rult =0
def two_sum(self):
for i in range(len(array)):
for j in array[i+1::]:
num = array[i] + j
if num == target:
self.T_F = True
print(num,"{}+{}={}".format(j,array[i],num))
else:
self.num_list.append(num)
self.num_list.sort()
font = self.num_list[self.num_list.index(self.target) - 1]
font_rult = "{}+{}={}".format(j,self.array[i],font)
if self.T_F == False:
print(self.font,self.font_rult)
array = [1,3,5,11,7]
target = 16
solution = Solution(array,target)
solution.two_sum()