![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ztgg
mllejuly
这个作者很懒,什么都没留下…
展开
-
adv02 DFS
// DFS// LC104. Maximum Depth of Binary Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) ...原创 2020-02-06 14:24:20 · 105 阅读 · 0 评论 -
adv01 Recursion
Tail Recursion# recursionpublic int factorial(int n) { if (n == 1) { return 1; } return n * factorial(n-1);}# non recursionpublic int fatorial(int n) { int sum = 1; for (int i = 1; i <...原创 2020-02-03 04:49:14 · 159 阅读 · 0 评论 -
adv00
ProgrammingAlgrithom: Time/Space Complexity, Sorting, Searching, DPData structure: HashMap, Stack, Queue…Operating SystemProcess/threads management, Scheduling concurrencyVirtual Memory, mutex...原创 2020-02-03 03:58:58 · 233 阅读 · 0 评论 -
ztgg_basic_03 Sort
import java.io.*;import java.util.*;class Solution { /////////////////////////////////////////////////////////////// // Bubble Sort // Always compare adjacent items if they are in...原创 2020-01-20 11:00:43 · 199 阅读 · 0 评论 -
ztgg_basic_02 Array ArrayList
2020.1.16import java.io.*;import java.util.*;class Solution { // 1. Sum of array numbers public static int sum(int[] nums) { int result = 0; for (int i = 0; i < nums.len...原创 2020-01-17 09:33:26 · 138 阅读 · 0 评论