aboutsummaryrefslogtreecommitdiff
path: root/magnetic_force_2_balls.cpp
diff options
context:
space:
mode:
authorjack <[email protected]>2024-06-14 13:13:15 -0600
committerjack <[email protected]>2024-06-14 13:13:15 -0600
commitd343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch)
tree96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /magnetic_force_2_balls.cpp
downloadleetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz
leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip
initial
Diffstat (limited to 'magnetic_force_2_balls.cpp')
-rw-r--r--magnetic_force_2_balls.cpp35
1 files changed, 35 insertions, 0 deletions
diff --git a/magnetic_force_2_balls.cpp b/magnetic_force_2_balls.cpp
new file mode 100644
index 0000000..af40160
--- /dev/null
+++ b/magnetic_force_2_balls.cpp
@@ -0,0 +1,35 @@
+#include "leetcode.h"
+
+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> position = {1, 2, 3, 4, 7};
+ int m = 3;
+ cout << obj.maxDistance(position, m);
+}