aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--marbles_in_bags.c28
-rw-r--r--marbles_in_bags.py33
2 files changed, 46 insertions, 15 deletions
diff --git a/marbles_in_bags.c b/marbles_in_bags.c
index 71c2560..95c1ee1 100644
--- a/marbles_in_bags.c
+++ b/marbles_in_bags.c
@@ -1,6 +1,5 @@
// 2551. Put Marbles in Bags
-#include <stdio.h>
-#include <stdlib.h>
+#include "leetcode.h"
/*
* you have 'k' bags. you are given a 0-indexed integer array 'weights' where
@@ -19,25 +18,24 @@
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
-long long putMarbles(int *weights, int weights_size, int k) {
- int n = weights_size;
- if (n == k || k == 1)
+long long putMarbles(int *weights, int weightsSize, int k) {
+ if (weightsSize == k || k == 1)
return 0;
- int *data = malloc((n - 1) * sizeof(int));
- for (int i = 0; i < n - 1; i++)
- data[i] = weights[i] + weights[i + 1];
- qsort(data, n - 1, sizeof(int), cmp);
- long long min = weights[0] + weights[n - 1];
- long long max = weights[0] + weights[n - 1];
+ int *pairs = (int *)malloc((weightsSize - 1) * sizeof(int));
+ for (int i = 0; i < weightsSize - 1; i++)
+ pairs[i] = weights[i] + weights[i + 1];
+ qsort(pairs, weightsSize - 1, sizeof(int), cmp);
+ long long min, max;
+ min = max = weights[0] + weights[weightsSize - 1];
for (int i = 0; i < k - 1; i++) {
- min += data[i];
- max += data[n - 2 - i];
+ min += pairs[i];
+ max += pairs[weightsSize - 2 - i];
}
return max - min;
}
int main() {
int w1[] = {1, 3, 5, 1}, w2[] = {1, 3};
- printf("%lld\n", putMarbles(w1, 4, 2)); // expect: 4
- printf("%lld\n", putMarbles(w2, 2, 2)); // expect: 0
+ printf("%lld\n", putMarbles(w1, ARRAY_SIZE(w1), 2)); // expect: 4
+ printf("%lld\n", putMarbles(w2, ARRAY_SIZE(w2), 2)); // expect: 0
}
diff --git a/marbles_in_bags.py b/marbles_in_bags.py
new file mode 100644
index 0000000..0cb520c
--- /dev/null
+++ b/marbles_in_bags.py
@@ -0,0 +1,33 @@
+# 2551. Put Marbles in Bags
+
+"""
+you have 'k' bags. you are given a 0-indexed integer array 'weights' where
+'weights[i]' is the weight of the i'th marble. you are also given the integer
+'k'. divide the marbles into the 'k' bags according to the following rules
+- no bag is empty
+- if the i'th marble and the j'th marble are in a bag, then all the marbles
+with an index between the i'th and j'th indices should also be in that same
+bag.
+- if a bag onsists of all the marbles with an index from 'i' to 'j'
+inclusively, then the cost of the bag is 'weights[i] + weights[j]' the score
+after distributing the marbles is the sum of the costs of all the 'k' bags.
+return the difference between the maximum and minimum scores among marble
+distributions
+"""
+
+
+class Solution(object):
+ def putMarbles(self, weights, k):
+ """
+ :type weights: List[int]
+ :type k: int
+ :rtype: int
+ """
+ pairs = sorted([weights[i] + weights[i + 1] for i in range(len(weights) - 1)])
+ return sum(pairs[len(pairs) - k + 1 :]) - sum(pairs[: k - 1])
+
+
+if __name__ == "__main__":
+ obj = Solution()
+ print(obj.putMarbles(weights=[1, 3, 5, 1], k=2))
+ print(obj.putMarbles(weights=[1, 3], k=2))