随笔分类 - 小辣鸡的leetcode刷题
摘要:600-700 605. 种花问题 (https://leetcode-cn.com/problems/can-place-flowers/) class Solution { public boolean canPlaceFlowers(int[] flowerbed, int n) { int[
阅读全文
摘要:400-500 404、左叶子之和 (https://leetcode-cn.com/problems/sum-of-left-leaves/) /** * Definition for a binary tree node. * public class TreeNode { * int val;
阅读全文
摘要:200-300 263. 丑数 (https://leetcode-cn.com/problems/ugly-number/) class Solution { public boolean isUgly(int n) { if(n < 1) return false; while(n % 5 ==
阅读全文

浙公网安备 33010602011771号