xevion/leetcode
1
0
Fork 0
mirror of https://github.com/Xevion/leetcode.git synced 2025-12-06 03:15:28 -06:00
Code Issues Packages Projects Releases Wiki Activity

Commit left over comments on two-pointers Rust solution

Browse Source
This commit is contained in:
Xevion
2023-10-08 20:09:14 -05:00
parent d28977dfa0
commit 2e9ffb549d
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
solutions/median-of-two-sorted-arrays/src/bin/two-pointers.rs
View File

@@ -5,6 +5,8 @@ impl Solution {
let (a_length, b_length) = (a.len(), b.len()); let (a_length, b_length) = (a.len(), b.len());
let (mut a_pointer, mut b_pointer, mut current, mut previous) = (0, 0, 0, 0); let (mut a_pointer, mut b_pointer, mut current, mut previous) = (0, 0, 0, 0);
// Iterate until middle + 1 [1, 2, 3, 4] => arr[2]
// On even length arrays, we need the previous value to calculate the median
for _ in 0..=((a_length+b_length)/2) { for _ in 0..=((a_length+b_length)/2) {
previous = current; previous = current;