Commit 34d0d7a

author

guangsheng.li01

committed

Solved 0973

1 parent 32ca543 commit 34d0d7aCopy full SHA for 34d0d7a

File tree

+39

-0

lines changed

+39

-0

lines changed

Lines changed: 38 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,38 @@`
	`1`	`+/*`
	`2`	`+ * [0973] k-closest-points-to-origin`
	`3`	`+ */`
	`4`	`+`
	`5`	`+pub struct Solution {}`
	`6`	`+`
	`7`	`+// solution impl starts here`
	`8`	`+`
	`9`	`+impl Solution {`
	`10`	`+ pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {`
	`11`	`+ let mut points = points;`
	`12`	`+ points.sort_by_key(\|p\| p[0] * p[0] + p[1] * p[1]);`
	`13`	`+ let mut closest_k = Vec::new();`
	`14`	`+ for i in 0..k as usize {`
	`15`	`+ closest_k.push(points[i].clone());`
	`16`	`+ }`
	`17`	`+ closest_k`
	`18`	`+ }`
	`19`	`+}`
	`20`	`+`
	`21`	`+// solution impl ends here`
	`22`	`+`
	`23`	`+// solution tests starts here`
	`24`	`+`
	`25`	`+#[cfg(test)]`
	`26`	`+mod tests {`
	`27`	`+ use super::*;`
	`28`	`+`
	`29`	`+ #[test]`
	`30`	`+ fn test_case0() {`
	`31`	`+ assert_eq!(`
	`32`	`+ Solution::k_closest(vec![vec![1, 3], vec![-2, 2]], 1),`
	`33`	`+ vec![[-2, 2]]`
	`34`	`+ );`
	`35`	`+ }`
	`36`	`+}`
	`37`	`+`
	`38`	`+// solution tests ends here`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -27,6 +27,7 @@ mod a0867_transpose_matrix;`
`27`	`27`	`mod a0929_unique_email_addresses;`
`28`	`28`	`mod a0931_minimum_falling_path_sum;`
`29`	`29`	`mod a0937_reorder_data_in_log_files;`
	`30`	`+mod a0973_k_closest_points_to_origin;`
`30`	`31`	`mod a1021_remove_outermost_parentheses;`
`31`	`32`	`mod a1047_remove_all_adjacent_duplicates_in_string;`
`32`	`33`	`mod a1200_minimum_absolute_difference;`

Comments

(0)