Question

There are N coins, each showing either heads or tails. We would like all the coins to form a sequence of alternating heads and tails. What is the minimum number of coins that must be reversed to achieve this? Write a function: class Solution public int solution (int [ ] A); } that, given an array A consisting of N integers representing the coins, returns the minimum number of coins that must be reversed. Consecutive elements of array A repreent consecutive coins and contain either a 0 (heads) or a 1 (tails). Examples: 1. Given array A = [1, 0, 1,0, 1, 1, the function should return 1. After reversing the sixth coin, we achieve an alternating sequence of coins [1, 0, 1, 0, 1, 0]. 2. Given array A = [1, 1, 0, 1, 1], the function should return 2. After reversing the first and fifth coins, we achieve an alternating sequence [0, 1, 0, 1, 0]. 3. Given array A = [O, 1,0], the function should return 0. The sequence of coins is already alternating. 4. Given array A = [0, 1, 1,O], the function should return 2. We can reverse the first and second coins to get the sequence: [1,0, 1, 0]. Assume that: N is an integer with in the range [1.100); each element of array A is an integer that can have one of the following values: 0, 1

Answer 1

Explanation:

please mark me as brainlist