1 package singlenumber136; 2 //Given an array of integers, every element appears twice except for one. Find that single one. 3 //Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? 4 public class Solution { 5 public static int singleNumber(int[] nums) { 6 int result=0; 7 for(int i=0;i