From 7c60dee83b436e8e8a667bf9f191beced8de4fc3 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Mon, 10 Mar 2025 00:36:13 -0600 Subject: chore: move cpp and rust code to directory --- other/magnetic_force_2_balls.cpp | 46 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 other/magnetic_force_2_balls.cpp (limited to 'other/magnetic_force_2_balls.cpp') 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 &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 &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 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 +} -- cgit v1.2.3