2024年12月16日
[LeetCode] 2730. Find the Longest Semi-Repetitive Substring
摘要： You are given a digit string s that consists of digits from 0 to 9. A string is called semi-repetitive if there is at most one adjacent pair of the sa 阅读全文
posted @ 2024-12-16 11:51 CNoodle 阅读(37) 评论(0) 推荐(0)