leetcode (137) Single Number II js代码实现

Single Number II

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

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

和136的题目相似，这次的题目中是除了一个数字出现一次之外其余的数字均出现一次

我们可以利用js中的indexOf()和lastIndexOf()方法，分别从数组的起始位置和末尾位置找到他们的索引，如果从前面找和从后面找的索引一致时，返回该索引对应的值

<span style="font-family:Helvetica Neue, Helvetica, Arial, sans-serif;color:#333333;">/**
 * @param {number[]} nums
 * @return {number}
 */
var singleNumber = function(nums) {
	for(var i = 0; i < nums.length; i++){
		l = nums.indexOf(nums[i]);
		r = nums.lastIndexOf(nums[i]);
		if(l == r)
			return nums[i];
	}
};
</span>