SolutionBefore.java

package org.moro.pages;

/**
 * Created by eyal on 14/11/2016.
 */
class SolutionBefore {
    public static void main(String[] args) {
        int[] array = {0};
        System.out.println(solution(array));
    }
       static int solution(int[] A) {
            int n = A.length;
            int result = 0;
            for (int i = 0; i < n - 1; i++) {
                if (A[i] == A[i + 1])
                    result = result + 1;
            }
            int r = -1;
            for (int i = 0; i < n; i++) {
                int count = 0;
                if (i > 0) {
                    if (A[i - 1] != A[i])
                        count = count + 1;
                    else
                        count = count - 1;
                }
                if (i < n - 1) {
                    if (A[i + 1] != A[i])
                        count = count + 1;
                    else
                        count = count - 1;
                }
                r = Math.max(r, count);
            }
            return result + r;
        }
    }