Commit c38f5f0

committed

136 Single Number

1 parent b57fdfe commit c38f5f0Copy full SHA for c38f5f0

File tree

+38

-0

lines changed

+38

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+# Single Number`
	`2`	`+`
	`3`	`+Given a non-empty array of integers, every element appears twice except for one. Find that single one.`
	`4`	`+`
	`5`	`+## Note`
	`6`	`+`
	`7`	`+Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?`
	`8`	`+`
	`9`	`+## Example 1`
	`10`	`+`
	`11`	`+Input: [2,2,1]`
	`12`	`+`
	`13`	`+Output: 1`
	`14`	`+`
	`15`	`+## Example 2`
	`16`	`+`
	`17`	`+Input: [4,1,2,1,2]`
	`18`	`+`
	`19`	`+Output: 4`
	`20`	`+`
	`21`	`+## More Info`
	`22`	`+`
	`23`	`+<https://leetcode.com/problems/single-number/>`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+/**`
	`2`	`+ * @param {number[]} nums`
	`3`	`+ * @return {number}`
	`4`	`+ */`
	`5`	`+var singleNumber = function(nums) {`
	`6`	`+ let myMap = {};`
	`7`	`+ for (let i = 0; i < nums.length; i++) {`
	`8`	`+ myMap[nums[i]] = myMap[nums[i]] == undefined ? 1 : ++myMap[nums[i]];`
	`9`	`+ }`
	`10`	`+ for(key in myMap){`
	`11`	`+ if(myMap[key] === 1) return Math.floor(key)`
	`12`	`+ }`
	`13`	`+};`
	`14`	`+`
	`15`	`+console.log(singleNumber([4,1,2,1,2]))`

Comments

(0)