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

  • mo7ali47
     + 0 comments

    Don't know if this is optimized or not but this is my solution in C++

    int flatlandSpaceStations(int n, vector<int> c) {
    if (c.size() == n) {
        return 0;
    } else {
        sort(c.begin(),c.end());
        int res = 0;
        for (int i = 1; i < c.size(); i++) {
            res = max(res, (c[i] - c[i-1]) / 2);
        }
        res = max(res, n - c[c.size()-1] - 1);
        res = max(res, c[0]);
        return res;
    }
}