closest

Given an array nums of n integers and an integer target , find three integers in nums such that the sum is closest to target . Return the sum of the three integers. You may assume that each input would have exactly one solution. Example: Given array nums = [-1, 2, 1, -4], and target = 1. The sum that is closest to the target is 2. (-1 + 2 + 1 = 2). 找到三个数的和，使这个和距离target距离最近。 思路和3sum差不多，只不过需要记录一下最短距离即可。 还是先将数组排序，然后利用两个指针去遍历数组。多了一步记录距离的过程，注意使用abs() class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: nums.sort() closest=float('inf') for i in range(len(nums)): if i!=0

1. Question 849. Maximize Distance to Closest Person url https://leetcode.com/problems/maximize-distance-to-closest-person/ In a row of seats , 1 represents a person sitting in that seat, and 0 represents that the seat is empty. There is at least one empty seat, and at least one person sitting. Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized. Return that maximum distance to closest person. Example 1: Input: [1,0,0,0,1,0,1] Output: 2 Explanation: If Alex sits in the second open seat (seats[2]), then the closest person has distance 2.

In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty. There is at least one empty seat, and at least one person sitting. Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized. Return that maximum distance to closest person. Example 1: Input: [1,0,0,0,1,0,1] Output: 2 Explanation: If Alex sits in the second open seat (seats[2]), then the closest person has distance 2. If Alex sits in any other open seat, the closest person has distance 1. Thus, the maximum distance to the closest person is 2.