Commit0e203a7

committed

Leetcode solution to the problem: find-the-difference-of-two-arrays

1 parentaddb959 commit0e203a7Copy full SHA for 0e203a7

File tree

+30

-0

lines changed

+30

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,30 @@`
	`1`	`+use std::collections::HashSet;`
	`2`	`+`
	`3`	`+implSolution{`
	`4`	`+pubfnfind_difference(nums1:Vec<i32>,nums2:Vec<i32>) ->Vec<Vec<i32>>{`
	`5`	`+`
	`6`	`+let s1:HashSet<i32> = nums1.into_iter().collect();`
	`7`	`+let s2:HashSet<i32> = nums2.into_iter().collect();`
	`8`	`+`
	`9`	`+letmut r1:HashSet<i32> =HashSet::new();`
	`10`	`+letmut r2:HashSet<i32> =HashSet::new();`
	`11`	`+`
	`12`	`+for nin&s1{`
	`13`	`+if !s2.contains(n){`
	`14`	`+ r1.insert(*n);`
	`15`	`+}`
	`16`	`+}`
	`17`	`+`
	`18`	`+for nin&s2{`
	`19`	`+if !s1.contains(n){`
	`20`	`+ r2.insert(*n);`
	`21`	`+}`
	`22`	`+}`
	`23`	`+`
	`24`	`+vec![`
	`25`	`+ r1.into_iter().collect(),`
	`26`	`+ r2.into_iter().collect(),`
	`27`	`+]`
	`28`	`+`
	`29`	`+}`
	`30`	`+}`

Comments

(0)