Commit9d23c3c

authored

Merge pull requestneetcode-gh#379 from dipti95/TypeScript_Javascript_solutions

twoSum and graphValidTree solutions

2 parentsf9cb77c +7f59c0e commit9d23c3cCopy full SHA for 9d23c3c

File tree

+53

-0

lines changed

+53

-0

lines changed

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,11 @@`
	`1`	`+functiontwoSum(nums:number[],target:number):number[]{`
	`2`	`+lethash:{[key:number]:number}={}`
	`3`	`+for(leti=0;i<nums.length;i++){`
	`4`	`+letdiff=target-nums[i]`
	`5`	`+if(diffinhash){`
	`6`	`+return[hash[diff],i]`
	`7`	`+}else{`
	`8`	`+hash[nums[i]]=i`
	`9`	`+}`
	`10`	`+}`
	`11`	`+}`

Lines changed: 42 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,42 @@`
	`1`	`+interfaceObj{`
	`2`	`+[key:number]:Array<number>`
	`3`	`+}`
	`4`	`+`
	`5`	`+interfaceVisited{`
	`6`	`+[key:number]:boolean`
	`7`	`+}`
	`8`	`+`
	`9`	`+functionvalidTree(n:number,edges:number[][]):boolean{`
	`10`	`+if(n===0)returntrue`
	`11`	`+`
	`12`	`+letadjacent:Obj={}`
	`13`	`+letvisited:Visited={}`
	`14`	`+for(leti=0;i<n;i++){`
	`15`	`+adjacent[i]=[]`
	`16`	`+}`
	`17`	`+`
	`18`	`+for(constvalofedges){`
	`19`	`+const[n1,n2]=val`
	`20`	`+adjacent[n1].push(n2)`
	`21`	`+adjacent[n2].push(n1)`
	`22`	`+}`
	`23`	`+`
	`24`	`+returndfs(0,-1,visited,adjacent)&&Object.keys(visited).length===n`
	`25`	`+}`
	`26`	`+`
	`27`	`+functiondfs(`
	`28`	`+node:number,`
	`29`	`+prevNode:number,`
	`30`	`+visited:Visited,`
	`31`	`+adjacent:Obj`
	`32`	`+):boolean{`
	`33`	`+if(visited[node])returnfalse`
	`34`	`+visited[node]=true`
	`35`	`+`
	`36`	`+for(consteleofadjacent[node]){`
	`37`	`+if(ele===prevNode)continue`
	`38`	`+if(!dfs(ele,node,visited,adjacent))returnfalse`
	`39`	`+}`
	`40`	`+`
	`41`	`+returntrue`
	`42`	`+}`

Comments

(0)