Commit80fd573

authored

Merge pull requestneetcode-gh#1103 from julienChemillier/patch-14

Add 684 in c language

2 parents89b07fa +679bc4c commit80fd573Copy full SHA for 80fd573

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+/*`
	`2`	`+Return an edge that can be removed so that the resulting graph is a tree of n nodes.`
	`3`	`+Time: O(n)`
	`4`	`+Space: O(n)`
	`5`	`+*/`
	`6`	`+intmax(inta,intb) {`
	`7`	`+returna>b?a:b;`
	`8`	`+}`
	`9`	`+`
	`10`	`+intfind(int*parent,intk) {`
	`11`	`+if (parent[k]==k)`
	`12`	`+returnk;`
	`13`	`+returnfind(parent,parent[k]);`
	`14`	`+}`
	`15`	`+`
	`16`	`+`
	`17`	`+`
	`18`	`+intfindRedundantConnection(intedges,intedgesSize,intedgesColSize,int*returnSize){`
	`19`	`+intans=malloc(sizeof(int)2);`
	`20`	`+intparent=malloc(sizeof(int)(edgesSize+1));`
	`21`	`+for (inti=0;i<=edgesSize;i++)`
	`22`	`+parent[i]=i;`
	`23`	`+for (inti=0;i<edgesSize;i++) {`
	`24`	`+intf1=find(parent,edges[i][0]);`
	`25`	`+intf2=find(parent,edges[i][1]);`
	`26`	`+if (f1==f2) {`
	`27`	`+ans[0]=edges[i][0];`
	`28`	`+ans[1]=edges[i][1];`
	`29`	`+ }else {// Union`
	`30`	`+parent[f1]=f2;`
	`31`	`+ }`
	`32`	`+ }`
	`33`	`+*returnSize=2;`
	`34`	`+returnans;`
	`35`	`+}`

Comments

(0)