Leetcode 849. Maximize Distance to Closest Person

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Maximize Distance to Closest Person

2. Solution

  • Version 1
class Solution {
public:
    int maxDistToClosest(vector<int>& seats) {
        int max_distance = 0;
        int distance = 0;
        int left = -1;
        int right = -1;
        int size = seats.size();
        for(int i = 0; i < seats.size(); i++) {
        	if(!seats[i]) {
                getRight(seats, right, i);
        		calculateDistance(i, left, right, max_distance, size);
        	}
        	else {
        		left = i;
        	}
        }
        return max_distance;
    }

private:
    void calculateDistance(int current, int left, int& right, int& max_distance, int size) {
    	int distance_left = INT_MAX;
    	int distance_right = INT_MAX;
    	int distance = 0;
    	if(left > -1) {
    		distance_left = current - left;
    	}
        if(right < size){
    		distance_right = right - current;
    	}
    	distance = min(distance_left, distance_right);
    	max_distance = max(max_distance, distance);
    }
    
    void getRight(vector<int>& seats, int& right, int current) {
        if(right <= current) {
    		for(int i = current + 1; i < seats.size(); i++) {
    			if(seats[i]) {
    				right = i;
    				break;
    			}
                else {
                    right = i + 1;
                }
    		}
    	}
    }
};
  • Version 2
class Solution {
public:
    int maxDistToClosest(vector<int>& seats) {
        int max_distance = 0;
        int distance = 0;
        int left = -1;
        int right = seats.size() - 1;
        for(int i = 0; i < seats.size(); i++) {
        	if(seats[i]) {
        		if(left == -1) {
        			max_distance = max(max_distance, i);
        		}
        		else {
        			max_distance = max(max_distance, (i - left) / 2);
        		}
        		left = i;
        	}
        }
        if(!seats[right]) {
        	max_distance = max(max_distance, right - left);
        }
        return max_distance;
    }
};

Reference

  1. https://leetcode.com/problems/maximize-distance-to-closest-person/description/
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值