Update 0004-median-of-two-sorted-arrays.rs

emanuele-em · web-flow · commit 41873d42b7b2 · 2023-10-23T07:58:12.000+02:00
diff --git a/rust/0004-median-of-two-sorted-arrays.rs b/rust/0004-median-of-two-sorted-arrays.rs
@@ -1,4 +1,4 @@
-// Version 1: focus on logic
+// Solution 1: focus on logic
 impl Solution {
     pub fn find_median_sorted_arrays(mut nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
         for val in nums2 {
@@ -12,7 +12,7 @@ impl Solution {
     }
 }
 
-// Version 2: focus on binary search
+// Solution 2: focus on binary search
 impl Solution {
     pub fn find_median_sorted_arrays(mut nums1: Vec<i32>, mut nums2: Vec<i32>) -> f64 {
         let total = nums1.len() + nums2.len();

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-// Version 1: focus on logic`
	`1`	`+// Solution 1: focus on logic`
`2`	`2`	`impl Solution {`
`3`	`3`	`pub fn find_median_sorted_arrays(mut nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {`
`4`	`4`	`for val in nums2 {`
`@@ -12,7 +12,7 @@ impl Solution {`
`12`	`12`	`}`
`13`	`13`	`}`
`14`	`14`
`15`		`-// Version 2: focus on binary search`
	`15`	`+// Solution 2: focus on binary search`
`16`	`16`	`impl Solution {`
`17`	`17`	`pub fn find_median_sorted_arrays(mut nums1: Vec<i32>, mut nums2: Vec<i32>) -> f64 {`
`18`	`18`	`let total = nums1.len() + nums2.len();`