摘要: LeetCode 剑指Offer II 119 一道水题,我首先想到的做法是暴力的枚举。 class Solution { public: int dp[100100],ans = 1; int longestConsecutive(vector<int>& nums) { int n = nums 阅读全文
posted @ 2021-10-22 20:51 killerboom 阅读(57) 评论(1) 推荐(0)