diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/max_distance_closest_person.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/max_distance_closest_person.cpp')
-rw-r--r-- | other/max_distance_closest_person.cpp | 39 |
1 files changed, 39 insertions, 0 deletions
diff --git a/other/max_distance_closest_person.cpp b/other/max_distance_closest_person.cpp new file mode 100644 index 0000000..a9203fe --- /dev/null +++ b/other/max_distance_closest_person.cpp @@ -0,0 +1,39 @@ +// 849. Maximize Distance to Closest Person +#include "leetcode.h" + +/* + * given an array representing a row of 'seats' where 'seats[i] = 1' represents + * a person sitting in the i'th seat, and 'seats[i] = 0' represents that the + * i'th 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 maximised. return that + * maximum distance to the closest person. + */ + +class Solution { +public: + int maxDistToClosest(vector<int> &seats) { + int n = seats.size(), empty = 0, ans = 0, idx1 = -1, idx2 = -1; + for (int i = 0; i < n; i++) { + if (seats[i] == 1) { + empty = 0; + if (idx1 == -1) + idx1 = i; + idx2 = i; + } else { + empty++; + ans = max(ans, (empty + 1) / 2); + } + } + ans = max({ans, idx1, n - 1 - idx2}); + return ans; + } +}; + +int main() { + Solution obj; + vector<int> s1 = {1, 0, 0, 0, 1, 0, 1}, s2 = {1, 0, 0, 0}, s3 = {0, 1}; + printf("%d\n", obj.maxDistToClosest(s1)); // expect: 2 + printf("%d\n", obj.maxDistToClosest(s2)); // expect: 3 + printf("%d\n", obj.maxDistToClosest(s3)); // expect: 1 +} |