本文共 815 字,大约阅读时间需要 2 分钟。
665.非递减数列
class Solution { public: bool checkPossibility(vector & nums) { int count=0;//记录非递增数个数 for (int i = 1; i < nums.size(); i++) { //根据总结的规律分类 if(nums[i]= nums[i - 2]) { nums[i - 1] = nums[i]; } else { nums[i] = nums[i - 1]; } count++;} } if (count > 1) return 0; else return 1; }};
class Solution { public:vector findDuplicates(vector nums){ vector out; if (nums.empty()) return out; if (nums.size() == 1) return out; if (nums.size() == 2) { if (nums[0] == nums[1]) return { nums[0] }; else return out; } sort(nums.begin(), nums.end()); //排序 int j; for (j = 0; j < nums.size()-1; j++) if (nums[j] == nums[j + 1]) { out.push_back(nums[j]); j++; } return out;} };
转载地址:http://ubmki.baihongyu.com/