Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- class Solution {
- public int solution(int[] coinsArray) {
- int size = coinsArray.length;
- int result = 0;
- for (int i = 0; i < size - 1; i++) {
- if (coinsArray[i] == coinsArray[i + 1])
- result = result + 1;
- }
- int r = -1;
- for (int i = 0; i < size; i++) {
- int count = 0;
- if (i > 0) {
- if (coinsArray[i - 1] != coinsArray[i])
- count = count + 1;
- else
- count = count - 1;
- }
- if (i < size - 1) {
- if (coinsArray[i + 1] != coinsArray[i])
- count = count + 1;
- else
- count = count - 1;
- }
- r = Math.min(r, count);
- }
- return size == 1 ? 0 : result + r;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement