leecode

public class Solution {
    public int singleNumber(int[] A) {
        int i,result=0; 
		   for(i=0;i

Given an array of integers, every element appears  twice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?



你可能感兴趣的:(leecode)