mllejuly的博客

// 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) ...

Tail Recursion # recursion public int factorial(int n) { if (n == 1) { return 1; } return n * factorial(n-1); } # non recursion public int fatorial(int n) { int sum = 1; for (int i = 1; i <...

Programming Algrithom: Time/Space Complexity, Sorting, Searching, DP Data structure: HashMap, Stack, Queue… Operating System Process/threads management, Scheduling concurrency Virtual Memory, mutex...

import java.io.*; import java.util.*; class Solution { /////////////////////////////////////////////////////////////// // Bubble Sort // Always compare adjacent items if they are in...

2020.1.16 import 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...