摘要: LeetCode 605. 种花问题 贪心 class Solution { public: bool canPlaceFlowers(vector<int>& flowerbed, int n) { int m = flowerbed.size(); int pre = -1; for(int i=0;i<m;i++){ //寻找区间 阅读全文
posted @ 2022-11-09 17:48 破忒头头 阅读(24) 评论(0) 推荐(0)