$5344223726634$ q$3$zay$7$

Compute the distance between the positions of the first and last zero element in the given array. For example, if the array is $301049506$ your algorithm should yield $7-1=6.$

If the array contains a single zero, return $0.$ If it doesn't contain any zeroes, return a negative value.

Numbers.java

NumbersTester.java

public class Numbers

T

public static int zeroesDistance$($double$[]$ values$)$

$\{$

int firstPos $=0$;

int lastPos $=$ values. length $-1$ ;

boolean found $=$ false;

while $($firstPos $$ values. length && $!$found$)$

$Y^{**}$ Your code goes here $*/$

return lastPos $-$ firstPos;

$\}$

$\}$