标签:Distance closest distance int seat Person person Maximize seats
You are given an array representing a row of seats
where seats[i] = 1
represents a person sitting in the ith
seat, and seats[i] = 0
represents that the ith
seat is empty (0-indexed).
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 the closest person.
Example 1:
Input: seats = [1,0,0,0,1,0,1] Output: 2 Explanation: If Alex sits in the second open seat (i.e. 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.
Example 2:
Input: seats = [1,0,0,0] Output: 3 Explanation: If Alex sits in the last seat (i.e. seats[3]), the closest person is 3 seats away. This is the maximum distance possible, so the answer is 3.
Example 3:
Input: seats = [0,1] Output: 1
Constraints:
2 <= seats.length <= 2 * 104
seats[i]
is0
or1
.- At least one seat is empty.
- At least one seat is occupied.
class Solution { public int maxDistToClosest(int[] seats) { int dist = Integer.MIN_VALUE; Map<Integer, Integer> map = new HashMap(); for(int i = 0; i < seats.length; i++) { if(seats[i] == 0) { int cur = distance(seats, i); map.put(i, cur); dist = Math.max(dist, cur); } } for(int i = 0; i < seats.length; i++) { if(seats[i] == 0 && dist == map.get(i)) return dist; } return -1; } public int distance(int[] seats, int ind) { int res = Integer.MAX_VALUE; for(int i = 0; i < seats.length; i++) { if(seats[i] == 1) res = Math.min(Math.abs(ind - i), res); } return res; } }
谁是max谁是min看清楚,bruteforce:把每个空的closest distance找出来,然后选最大的。
标签:Distance,closest,distance,int,seat,Person,person,Maximize,seats 来源: https://www.cnblogs.com/wentiliangkaihua/p/13900169.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。