Update 0424-longest-repeating-character-replacement.py

[akxavier]

The length of the substring doesn't decrease - it either stays the same (when the condition (r - l + 1) - maxf > k is true and we increment l) or increases otherwise. Hence once it reaches the maximum substring value, it never goes down. So instead of taking max(res, r - l + 1) in each iteration, just return the value (r - l + 1) at the end of the loop.

• File(s) Modified: 0424-longest-repeating-character-replacement.py
• Language(s) Used: python
• Submission URL: https://leetcode.com/problems/longest-repeating-character-replacement/submissions/982126382/

Important

Please make sure the file name is lowercase and a duplicate file does not already exist before merging.