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/magnetic_force_2_balls.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/magnetic_force_2_balls.cpp')
-rw-r--r-- | other/magnetic_force_2_balls.cpp | 46 |
1 files changed, 46 insertions, 0 deletions
diff --git a/other/magnetic_force_2_balls.cpp b/other/magnetic_force_2_balls.cpp new file mode 100644 index 0000000..8416deb --- /dev/null +++ b/other/magnetic_force_2_balls.cpp @@ -0,0 +1,46 @@ +// 1552. Magnetic Force Between Two Balls +#include "leetcode.h" + +/* + * in the universe earth c-137 rick discovered a special form of magnetic force + * between two balls if they are put in his new invented basket. rick has 'n' + * empty baskets the i'th basket is at 'position[i]', more has 'm' ball and + * needs to distribute the balls into the baskets such that the minimum magnetic + * force between any two balls is maximum. rick stated that magnetic force + * betweeen two different balls at positions 'x' and 'y' is '|x - y|'. given the + * integer array 'position' and the integer 'm', return the required force. + */ + +class Solution { +public: + int maxDistance(vector<int> &position, int m) { + sort(position.begin(), position.end()); + int ans = 1, i = 999999999; + while (ans < i) { + int mid = (ans + i) / 2 + 1; + if (check(position, m, mid)) + ans = mid; + else + i = mid - 1; + } + return ans; + } + +private: + int check(vector<int> &position, int m, int force) { + int pos = position[0]; + for (auto i = 1; i < position.size() && m > 1; ++i) + if (position[i] - pos >= force) { + --m; + pos = position[i]; + } + return m < 2; + } +}; + +int main() { + Solution obj; + vector<int> p1 = {1, 2, 3, 4, 7}, p2 = {5, 4, 3, 2, 1, 1000000000}; + printf("%d\n", obj.maxDistance(p1, 3)); // expect: 3 + printf("%d\n", obj.maxDistance(p2, 2)); // expect: 999999999 +} |