/**
* https://leetcode.com/problems/single-number/
* @param {number[]} nums
* @return {number}
*/
var singleNumber = function(nums) {
var answer = nums[nums.length-1];
for (let i = 0; i < nums.length - 1 ; i++) {
if (nums.indexOf(nums[i], i+1) === -1 && nums.indexOf(nums[i]) === i) {
answer = nums[i];
break;
}
}
return answer;
};
'알고리즘 > LeetCode' 카테고리의 다른 글
[Leetcode][Javascript][Medium] 718. Maximum Length of Repeated Subarray (0) | 2021.07.09 |
---|---|
[Leetcode][Javascript][Easy] 202. Happy Number (0) | 2021.07.08 |
[Leetcode][Javascript][Easy] 70. Climbing Stairs (0) | 2021.07.06 |
[Leetcode][Javascript][Easy] 169. Majority Element (0) | 2021.07.06 |
[Leetcode][Javascript][Easy] 21. Merge Two Sorted Lists (0) | 2021.07.06 |
댓글