@@ -0,0 +1,591 @@
+/*%0A136. Single Number%0AEasy%0A%0AGiven a non-empty array of integers, every element appears twice except for one. Find that single one.%0A%0ANote:%0A%0AYour algorithm should have a linear runtime complexity. Could you implement it without using extra memory?%0A%0AExample 1:%0A%0AInput: %5B2,2,1%5D%0AOutput: 1%0AExample 2:%0A%0AInput: %5B4,1,2,1,2%5D%0AOutput: 4%0A*/%0A%0Aclass Solution %7B%0A    public int singleNumber(int%5B%5D nums) %7B%0A        int t = 0; %0A        %0A        // %E5%BC%82%E6%88%96%EF%BC%9A%E7%9B%B8%E5%90%8C%E4%B8%BA 0%EF%BC%8C%E4%B8%8D%E5%90%8C%E4%B8%BA 1%0A        // %E4%B8%8E 0 %E5%BC%82%E6%88%96%E4%B8%BA%E6%9C%AC%E8%BA%AB%EF%BC%8C%E4%B8%8E%E6%9C%AC%E8%BA%AB%E5%BC%82%E6%88%96%E4%B8%BA 0%0A        for (int i = 0; i %3C nums.length; i++) %7B%0A            t %5E= nums%5Bi%5D;%0A        %7D%0A        %0A        return t;%0A    %7D%0A%7D

add p136