2414. Length of the Longest Alphabetical Continuous Substring
class Solution:def longestContinuousSubstring(self, s: str) -> int:ans=1tans=ansfor i in range(1,len(s)):if ord(s[i])==ord(s[i-1])+1:tans+=1ans=max(ans,tans)else:tans=1return ans
2414. Length of the Longest Alphabetical Continuous Substring
class Solution:def longestContinuousSubstring(self, s: str) -> int:ans=1tans=ansfor i in range(1,len(s)):if ord(s[i])==ord(s[i-1])+1:tans+=1ans=max(ans,tans)else:tans=1return ans
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.mzph.cn/news/879040.shtml
如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!