Commitccb2234

Kohei Asai

authored

961. N-Repeated Element in Size 2N Array (#128)

1 parenteddf02e commitccb2234Copy full SHA for ccb2234

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+// 961. N-Repeated Element in Size 2N Array`
	`2`	`+// https://leetcode.com/problems/n-repeated-element-in-size-2n-array/submissions/`
	`3`	`+exportdefaultfunctionrepeatedNTimes<T>(A:T[]):T{`
	`4`	`+constfound=newSet();`
	`5`	`+`
	`6`	`+for(constvalueofA){`
	`7`	`+if(found.has(value))returnvalue;`
	`8`	`+`
	`9`	`+found.add(value);`
	`10`	`+}`
	`11`	`+`
	`12`	`+thrownewError("unreachable here");`
	`13`	`+}`

Lines changed: 10 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,10 @@`
	`1`	`+import{test}from"https://deno.land/std/testing/mod.ts";`
	`2`	`+import{assertStrictEq}from"https://deno.land/std/testing/asserts.ts";`
	`3`	`+importrepeatedNTimesfrom"./n_repeated_element_in_size_2n_array.ts";`
	`4`	`+`
	`5`	`+test("961. N-Repeated Element in Size 2N Array",()=>{`
	`6`	`+assertStrictEq(repeatedNTimes([1,2,3,3]),3);`
	`7`	`+assertStrictEq(repeatedNTimes([2,1,2,5,3,2]),2);`
	`8`	`+assertStrictEq(repeatedNTimes([2,1,2,5,3,2]),2);`
	`9`	`+assertStrictEq(repeatedNTimes([5,1,5,2,5,3,5,4]),5);`
	`10`	`+});`

Comments

(0)