|
1 | 1 | packagecom.fishercoder.solutions; |
2 | 2 |
|
3 | | -/** |
4 | | - * 1217. Play with Chips |
5 | | - * |
6 | | - * There are some chips, and the i-th chip is at position chips[i]. |
7 | | - * You can perform any of the two following types of moves any number of times (possibly zero) on any chip: |
8 | | - * |
9 | | - * Move the i-th chip by 2 units to the left or to the right with a cost of 0. |
10 | | - * Move the i-th chip by 1 unit to the left or to the right with a cost of 1. |
11 | | - * |
12 | | - * There can be two or more chips at the same position initially. |
13 | | - * |
14 | | - * Return the minimum cost needed to move all the chips to the same position (any position). |
15 | | - * |
16 | | - * Example 1: |
17 | | - * Input: chips = [1,2,3] |
18 | | - * Output: 1 |
19 | | - * Explanation: Second chip will be moved to positon 3 with cost 1. First chip will be moved to position 3 with cost 0. Total cost is 1. |
20 | | - * |
21 | | - * Example 2: |
22 | | - * Input: chips = [2,2,2,3,3] |
23 | | - * Output: 2 |
24 | | - * Explanation: Both fourth and fifth chip will be moved to position two with cost 1. Total minimum cost will be 2. |
25 | | - * |
26 | | - * Constraints: |
27 | | - * 1 <= chips.length <= 100 |
28 | | - * 1 <= chips[i] <= 10^9 |
29 | | - * */ |
30 | 3 | publicclass_1217 { |
31 | 4 | publicstaticclassSolution1 { |
32 | | -/**credit: https://leetcode.com/problems/play-with-chips/discuss/398239/C%2B%2B-3-lines*/ |
| 5 | +/** |
| 6 | + * credit: https://leetcode.com/problems/play-with-chips/discuss/398239/C%2B%2B-3-lines |
| 7 | + */ |
33 | 8 | publicintminCostToMoveChips(int[]chips) { |
34 | 9 | intchipsAtOddPosition =0; |
35 | 10 | intchipsAtEvenPosition =0; |
|