JS_STA的博客

class Solution0 { static int ans; public int diameterOfBinaryTree(TreeNode root) { if(root==null) return 0; ans = 1; depth(root); return ans - 1; } public int depth(TreeNode node) { if (node == null)

使用堆class Solution { public int[] topKFrequent(int[] nums, int k) { Map<Integer, Integer> occurrences = new HashMap<Integer, Integer>(); for (int num : nums) { occurrences.put(num, occurrences.getOrDefault(num, 0

public static void main(String[] args) { System.out.println(numSquares(2)); } // 13 4 9 public static int numSquares(int n) { int[] f = new int[n + 1]; for (int i = 1; i <= n; i++) { int minn = Integer...

class Solution2 { public static void main(String[] args) { int[] nums = {1, 3, -1, -3, 5}; int[] numd = {0, 1, 2, 3, 4}; int[] ints = maxSlidingWindow(nums, 3); System.out.println(Arrays.toString(ints)); } publ

class Solution1 { public int rob2(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int length = nums.length; if (length == 1) { return nums[0]; } int[] dp = new in

class Trie { private Trie[] children; private boolean isEnd; public Trie() { children = new Trie[26]; isEnd = false; }// word work public void insert(String word) { Trie node = this; for (int i = 0; .

https://www.cnblogs.com/of-fanruice/p/7678801.html