feat: move l until nums[l] and nums[r] have same value

jtr109 · jtr109 · commit a7d514e1beef · 2021-05-28T17:07:25.000+08:00
diff --git a/maximum_erasure_value/src/lib.rs b/maximum_erasure_value/src/lib.rs
@@ -10,8 +10,10 @@ impl Solution {
             if r == nums.len() {
                 break;
             }
-            while nums[l..r].contains(&nums[r]) {
-                // TODO: increase l until nums[l] == nums[r]
+            if nums[l..r].contains(&nums[r]) {
+                while nums[l] != nums[r] {
+                    l += 1;
+                }
                 l += 1;
             }
             let sum = nums[l..=r].iter().sum();

Original file line number	Diff line number	Diff line change
`@@ -10,8 +10,10 @@ impl Solution {`
`10`	`10`	`if r == nums.len() {`
`11`	`11`	`break;`
`12`	`12`	`}`
`13`		`- while nums[l..r].contains(&nums[r]) {`
`14`		`- // TODO: increase l until nums[l] == nums[r]`
	`13`	`+ if nums[l..r].contains(&nums[r]) {`
	`14`	`+ while nums[l] != nums[r] {`
	`15`	`+ l += 1;`
	`16`	`+ }`
`15`	`17`	`l += 1;`
`16`	`18`	`}`
`17`	`19`	`let sum = nums[l..=r].iter().sum();`