class Solution: def threeConsecutiveOdds(self, arr: List[int]) -> bool: i = 0 while i < len(arr) - 2: jump = 0 if arr[i] % 2: if arr[i+1] % 2: if arr[i+2] % 2: return True else: jump += 2 else: jump += 1 i += 1 + jump return False 分类: LeetCode 标签:...
classSolution {public:intlongestConsecutive(vector<int> &num) { unordered_map<int,bool>dict;//initfor(inti =0; i < num.size(); i++) { dict[num[i]]=false; }intans =0;for(inti =0; i < num.size(); i++) {if(dict[num[i]] ==false) {intcnt =0;//枚举相邻的数,看是否在...
129 Sum Root to Leaf Numbers C++, Python Medium 128 Longest Consecutive Sequence C++ Hard 127 Word Ladder C++ Medium 126 Word Ladder II C++ Hard 125 Valid Palindrome C++, Java Easy 124 Binary Tree Maximum Path Sum C++, Java Hard 123 Best Time to Buy and Sell Stock III C++ Hard 122 Best...
junjiecjj/leetCodePublic forked fromHuberTRoy/leetCode NotificationsYou must be signed in to change notification settings Fork0 Star0 Code Pull requests Actions Projects Security Insights Additional navigation options Files 0bc0920 MergerTwoSortedList.py ...