Commitda490d1

committed

add: Clone Graph

1 parent9d4b634 commitda490d1Copy full SHA for da490d1

File tree

+38

-0

lines changed

+38

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -34,6 +34,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`34`	`34`	`\|91\|[Decode Ways](https://leetcode.com/problems/decode-ways/)\|[JavaScript](./src/decode-ways/res.js)\|Medium\|`
`35`	`35`	`\|120\|[Triangle](https://leetcode.com/problems/triangle/)\|[JavaScript](./src/triangle/res.js)\|Medium\|`
`36`	`36`	`\|130\|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)\|[JavaScript](./src/surrounded-regions/res.js)\|Medium\|`
	`37`	`+\|133\|[Clone Graph](https://leetcode.com/problems/clone-graph/)\|[JavaScript](./src/clone-graph/res.js)\|Medium\|`
`37`	`38`	`\|136\|[Single Number](https://leetcode.com/problems/single-number/)\|[JavaScript](./src/single-number/res.js)\|Easy\|`
`38`	`39`	`\|152\|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)\|[JavaScript](./src/maximum-product-subarray/res.js)\|Medium\|`
`39`	`40`	`\|175\|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)\|[SQL](./src/combine-two-tables/res.txt)\|Easy\|`

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+/**`
	`2`	`+ * res.js`
	`3`	`+ *@authors Joe Jiang (hijiangtao@gmail.com)`
	`4`	`+ *@date 2017-04-16 22:11:56`
	`5`	`+ *`
	`6`	`+ * Problem: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.`
	`7`	`+ *`
	`8`	`+ * Definition for undirected graph.`
	`9`	`+ * function UndirectedGraphNode(label) {`
	`10`	`+ * this.label = label;`
	`11`	`+ * this.neighbors = []; // Array of UndirectedGraphNode`
	`12`	`+ * }`
	`13`	`+ */`
	`14`	`+`
	`15`	`+/**`
	`16`	`+ *@param {UndirectedGraphNode} graph`
	`17`	`+ *@return {UndirectedGraphNode}`
	`18`	`+ */`
	`19`	`+letcloneGraph=function(graph){`
	`20`	`+// if (!graph) return graph;`
	`21`	`+letres={};`
	`22`	`+returniterateGraph(graph);`
	`23`	`+`
	`24`	`+functioniterateGraph(subgraph){`
	`25`	`+if(!subgraph){`
	`26`	`+returnsubgraph;`
	`27`	`+}`
	`28`	`+`
	`29`	`+letid=subgraph.label;`
	`30`	`+if(!res[id]){`
	`31`	`+res[id]=newUndirectedGraphNode(id);`
	`32`	`+res[id].neighbors=subgraph.neighbors.map(iterateGraph);`
	`33`	`+}`
	`34`	`+`
	`35`	`+returnres[id];`
	`36`	`+}`
	`37`	`+};`

Comments

(0)