作者dont (dont)
標題Re: [閒聊] 每日leetcode
時間2024-09-14 14:24:49
2419. Longest Subarray With Maximum Bitwise AND
## 思路
AND值會變小, 所以目標是找裡面都是相同最大值的subarray
用while迴圈感覺好長 唉
## Code
```python
class Solution:
def longestSubarray(self, nums: List[int]) -> int:
res = curr_max = 0
i, n = 0, len(nums)
while i < n:
cnt = 1
while i + cnt < n and nums[i+cnt] == nums[i]:
cnt += 1
if nums[i] > curr_max:
curr_max, res = nums[i], cnt
elif nums[i] == curr_max:
res = max(res, cnt)
i += cnt
return res
```
--
https://i.imgur.com/kyBhy6o.jpeg
--
※ 發信站: 批踢踢實業坊(pttweb.org.tw), 來自: 185.213.82.187 (臺灣)
※ 文章網址: https://pttweb.org.tw/Marginalman/M.1726295093.A.A35
推 DJYOMIYAHINA: 大師 09/14 14:38
