Single number 1 [LeetCode] 자바 136. Single Number 136. Single Number Easy Given a non-empty 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? Example 1: Input: [2,2,1] Output: 1 Example 2: Input: [4,1,2,1,2] Output: 4 문제는 간단합니다. int array 가 들어오는데 거기서 홀로 있는 number를 찾아서 return 하시오. class Solution { pu.. 2020. 8. 8. 이전 1 다음
