摘要:
https://leetcode.com/problems/implement-trie-prefix-tree/#/description Implement a trie with insert, search, and startsWith methods. Note:You may assu 阅读全文
摘要:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { ... 阅读全文
摘要:
public class Solution { public int smallestFactorization(int a) { if (a factor = new ArrayList(); for (int i = 9; i > 1; i--) { while (a % i == 0) { f... 阅读全文