There are a number of students standing in a single-file line Each student is numbered sequentially...

 

  

Transcribed Image Text:

There are a number of students standing in a single-file line Each student is numbered sequentially from 0. Each student also has a binary digit associated with them, where O indicates the student's performance is above average and 1 indicates the student's performance is below average. The teacher wants to group the students by performhance on opposite ends of the line such that the number of adjacent pairs of students where one student is a 0 and the other student is a 1 is minimized. To accomplish this, any student can swap places in line with the student located immediately in front of or behind them Each time a pair of students Twaps places, it counts as a move. Determine the minimum number of moves needed to create an optimal configuration For exampie, there are nad students arranged as avg=0,1,0.1. With I move,; switching students 1 and 2, we get the array (0,0.1,1 which is optimal Function Description Complete the function minMoves in the editor below. The function must return an integer denoting the minimum number of moves necessary to achieve an optimal configuration minMoves has the following parameterts). avgjavg|0). avgin 1 an array of binary digits Constraints 1sns 10 • avg E 10, 1) Input Format for Custom Testing Impur trom samw procesea as follows and passed to the function. The first line contains an integer n, the size of the array avg. Each of the next n lineh contains a birary digit as an integer, avg Sample Case O Explanation 0 There is only one pair of above and below average students standing next to each other. This cannot be reduced, so no moves are necessary. Sample Case 1 Sample Input 11110101 Sample Output 1 Explanation 1 We can perform the following minimal sequence of 3 moves 1 1110IO1-11111001-111116 contiguration 111110 e to achieve an optimal Sample Case 2 Sample Impurz 101000e1 Sample Output 2 Explanation 2 We can perform the following minimal sequence of 6 moves 10iee001-11eee e e1-11eee010-110ee1 ee-11ee10 00-1 L e e to achieve an optimal configuration 1 * import java.1o.; 12 13 14 1S class Result ( 16 17 H 18 * Complete the mintoves function below. 19 * The function is expected to return an INTEGER. * The function accepts INTEGER ARRAY avg as parameter, 20 21 22 23 publie static int minMoves(List<Integer> avg) ( / weite your code here 24E 25 26 27 28 29 30 31 public class Solution ( 58 There are a number of students standing in a single-file line Each student is numbered sequentially from 0. Each student also has a binary digit associated with them, where O indicates the student's performance is above average and 1 indicates the student's performance is below average. The teacher wants to group the students by performhance on opposite ends of the line such that the number of adjacent pairs of students where one student is a 0 and the other student is a 1 is minimized. To accomplish this, any student can swap places in line with the student located immediately in front of or behind them Each time a pair of students Twaps places, it counts as a move. Determine the minimum number of moves needed to create an optimal configuration For exampie, there are nad students arranged as avg=0,1,0.1. With I move,; switching students 1 and 2, we get the array (0,0.1,1 which is optimal Function Description Complete the function minMoves in the editor below. The function must return an integer denoting the minimum number of moves necessary to achieve an optimal configuration minMoves has the following parameterts). avgjavg|0). avgin 1 an array of binary digits Constraints 1sns 10 • avg E 10, 1) Input Format for Custom Testing Impur trom samw procesea as follows and passed to the function. The first line contains an integer n, the size of the array avg. Each of the next n lineh contains a birary digit as an integer, avg Sample Case O Explanation 0 There is only one pair of above and below average students standing next to each other. This cannot be reduced, so no moves are necessary. Sample Case 1 Sample Input 11110101 Sample Output 1 Explanation 1 We can perform the following minimal sequence of 3 moves 1 1110IO1-11111001-111116 contiguration 111110 e to achieve an optimal Sample Case 2 Sample Impurz 101000e1 Sample Output 2 Explanation 2 We can perform the following minimal sequence of 6 moves 10iee001-11eee e e1-11eee010-110ee1 ee-11ee10 00-1 L e e to achieve an optimal configuration 1 * import java.1o.; 12 13 14 1S class Result ( 16 17 H 18 * Complete the mintoves function below. 19 * The function is expected to return an INTEGER. * The function accepts INTEGER ARRAY avg as parameter, 20 21 22 23 publie static int minMoves(List<Integer> avg) ( / weite your code here 24E 25 26 27 28 29 30 31 public class Solution ( 58

Answer rating: 100% (QA)

LOGIC To make sure that number of adjacent pairs of students where one student is a 0 and the other ... View the full answer