https://leetcode-cn.com/problems/missing-two-lcci/
class Solution:
import math
def missingTwo(self, nums: List[int]) -> List[int]:
max_num = len(nums)+2
sum_miss = max_num*(max_num+1)//2-sum(nums)
prod_nums = 1
prod_max = 1
for i in nums:
prod_nums *= i
for i in range(1,max_num+1):
prod_max *= i
prod_miss = prod_max // prod_nums
miss_first = (sum_miss+math.sqrt(sum_miss**2-4*prod_miss))//2
miss_second = sum_miss - miss_first
return [int(miss_first), int(miss_second)]
因篇幅问题不能全部显示,请点此查看更多更全内容
Copyright © 2019- ovod.cn 版权所有 湘ICP备2023023988号-4
违法及侵权请联系:TEL:199 1889 7713 E-MAIL:2724546146@qq.com
本站由北京市万商天勤律师事务所王兴未律师提供法律服务