Let's play a game on an array! You're standing at index 0 of an n-element array named game. From some index i (where 0 < i < n), you can perform one of the following moves: • Move Backward: If cell i – 1 exists and contains a 0, you can walk back to cell i – 1. • Move Forward: • If cell i +1 contains a zero, you can walk to cell i + 1. • If cell i + leap contains a zero, you can jump to cell i + leap. • If you're standing in cell n – 1 or the value of i + leap > n, you can walk or jump off the end of the array and win the game. In other words, you can move from index i to index i + 1. i – 1, or i + leap as long as the destination index is a cell containing a 0. If the destination index is greater than n – 1. you win the game. Function Description Complete the canWin function in the editor below. canWin has the following parameters: • int leap: the size of the leap • int game[n]: the array to traverse Returns • boolean: true if the game can be won, otherwise false Input Format The first line contains an integer, q, denoting the number of queries (i.e., function calls). The 2 · q subsequent lines describe each query over two lines: 1. The first line contains two space-separated integers describing the respective values of n and leap. 2. The second line contains n space-separated binary integers (i.e., zeroes and ones) describing the respective values of gameo, gamej,.. gamen

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Please do not copy from other sources.

I provided 2 pictures of the question and part of the code. Please complete it by your own.

Here is a part of the code for your privilege :

import java.util.*;

public class Solution {

public static boolean canWin(int leap, int[] game) {
// Return true if you can win the game; otherwise, return false.
}

public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int q = scan.nextInt();
while (q-- > 0) {
int n = scan.nextInt();
int leap = scan.nextInt();

int[] game = new int[n];
for (int i = 0; i < n; i++) {
game[i] = scan.nextInt();
}

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
}
scan.close();
}
}