algorithm - Finding the minimum of all numbers that are positive in java -

i'm having trouble ignore negative numbers in finding minimum of given numbers. here code print minimum number taking 10 inputs user in java. (i'm fresher student , new in java. if find mistake please me figure out)

scanner k = new scanner (system.in); int x, y, min; system.out.println ("enter number"); x = k.nextint(); min = x;  (int count=1; count < 10; count++) {     system.out.println ("enter number");     y = k.nextint;     if (y < min) {         min = y;     } }  system.out.println (min); 

that code find minimum number. want find minimum of positive numbers. if user enters negative number want ignore number.

help me make code of finding minimum number ignoring negative numbers.

if(y<min&&y>=0) 

is mean?

private static scanner k = new scanner (system.in); public static void main(string[] args) {   int min=getnumber(false);   (int count=1; count<10; count++) {     int y=getnumber(true);     if(y<min&&y>=0)       min=y;   }   system.out.println(min); } private static int getnumber(boolean allownegative) {   system.out.println("please enter integer:");   int n=0;   try {     n=integer.parseint(k.nextline());   } catch(numberformatexception nfe) {     system.err.println("input must integer...");     return getnumber(allownegative);   }   if(allownegative) {     return n;   } else {     if(n<0) {       system.out.println("you cannot start negative number...");       return getnumber(allownegative);     } else {       return n;     }   } }