136. Single Number

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

代码如下：

 public class Solution {
     public int singleNumber(int[] nums) {
         if(nums.length==1)
         return nums[0];

         Arrays.sort(nums);
         int s=0;
         for(int i=0;i<nums.length-1;)
         {
             if(nums[i]==nums[i+1])
             i=i+2;
             else
             {return nums[i]; }
         }

         return nums[nums.length-1];

     }
 }