[LeetCode/릿코드] 136. Single Number
문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 import java.util.Arrays; import java.util.Collections; class Solution { public int singleNumber(int[] nums) { int answer = 0; for(int i : nums) { answer ^= i; } return answer; } } Colored by Color Scripter cs
