We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Flatland Space Stations
  5. Discussions

Flatland Space Stations

Sort by

recency

|

949 Discussions

|

  • anarod_val25
     + 0 comments

    Is the custom comparator too much? Maybe. But it's funnier that way.

    int flatlandSpaceStations(int n, vector<int> c) {
    int longuest = 0;
    
    for(int i = 0; i<n; i++ ){
        
        if(find(c.begin(), c.end(), i)==c.end()){
            int closest = *min_element(c.begin(),c.end(),
                            [&](int a, int b){
                                return abs(a - i) < abs(b - i);
                            });
            
            longuest = abs(closest-i)>longuest? abs(closest-i) : longuest;
        }
        
    }
    
    return longuest;
}

  • krushnaingale201
     + 0 comments

    JAVA

    static int flatlandSpaceStations(int n, int[] c) {

        ArrayList<Integer> arrayList = new ArrayList<>();
    for(int i=0;i<n;i++){
        int k=0;
        int res = Integer.MAX_VALUE;
        while(k<c.length){
            int res1 = c[k]-i;
            if(res1<0){
                res1 = 0-res1;
            }
            if(res>res1){
                res = res1;
            }
            k++;
        }
        arrayList.add(res);
    }
    int max = 0;
    for(int i =0;i<arrayList.size();i++){
        if(arrayList.get(i)>max){
            max = arrayList.get(i);
        }
    }
    return max;
}

  • luka_robajac
     + 0 comments
    function flatlandSpaceStations($n, $m, $c) {
    sort($c);

    $max = $c[0];
    for($i = 0; $i < $m - 1; $i++) {
        $dist = floor(($c[$i + 1] - $c[$i]) / 2);
        if($dist > $max) {
            $max = $dist;
        }
    }
    
    $max = max($max, $n - 1 - $c[$m - 1]);
    
    return $max;
}

  • afzal_saiyed931
     + 0 comments
    def flatlandSpaceStations(n, m, c):
    if n == m:
        return 0
    c = sorted(c)
    start_distance = c[0]
    end_distance = (n-1) - c[-1]
    mid_distance = None
    for i in range(len(c)-1):
        gap = c[i+1] - c[i]
        distance = gap // 2
        if mid_distance is None or distance > mid_distance:
            mid_distance = distance
            
    return max(start_distance, mid_distance or 0, end_distance)

  • gabriel_atenci4
     + 0 comments

    js my solution... if (n == c.length) return 0;

    const lengthC = c.length - 1;

    c.sort((a, b) => a - b); console.log(c);

    let max = c[0]; for (let i = 0; i < lengthC; i++) { const tmp = Math.floor(c[i + 1] - (c[i + 1] + c[i]) / 2);

    if (tmp > max) max = tmp; }

    let lastOne = n - c[lengthC] - 1;

    if (lastOne > max) max = lastOne;

    console.log(max);