Computer questions (Elementary)-Xiao Ming's chopsticks (Java)

Computer questions (Elementary)-Xiao Ming's chopsticks (Java)

The questions are as follows:

The Code is as follows:

Package huawei; import java. util. hashMap; import java. util. map; import java. util. examples; public class Demo {public static int checkChopsticks (int [] chopsticks) {/** the key of map is used as the length of chopsticks, and value is used as the number of chopsticks */Map
 
  
Hm = new HashMap
  
   
(); Int count = 0; for (int I = 0; I <chopsticks. length; I ++) {if (hm. containsKey (chopsticks [I]) {count = hm. get (chopsticks [I]) + 1; // Number of chopsticks plus 1} else {count = 1;} hm. put (chopsticks [I], count) ;}for (int I = 0; I <chopsticks. length; I ++) {if (hm. get (chopsticks [I]) % 2 = 0) {continue;} else if (hm. get (chopsticks [I]) % 2! = 0) {return chopsticks [I] ;}} return-1 ;}public static void main (String [] agrs) {condition cin = new condition (System. in); String input = cin. nextLine (); String [] string = input. split (","); int [] inputInt = new int [string. length]; for (int I = 0; I <string. length; I ++) {inputInt [I] = Integer. parseInt (string [I]);} int n = checkChopsticks (inputInt); System. out. println (n );}}