li_super的博客

记录一下递归 public static int Fibonacci(int n ){ switch (n){ case 0: return 0; case 1: return 1; case 2: return 1; } return Fibonacci...

import java.util.*;public class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); while (sc.hasNext()) { long x = sc.nextLong()...

/*public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; }}*/public class Solution { bo...

Linux/操作系统《Linux核心命令速查》《Windows核心编程》《Linux企业运维实战》前端《Vue.js 前端开发》《锋利的Jquery》面试系列《程序员面试笔试宝典》《Java程序员面试笔试宝典》《Java算法宝典》《Oracle数据库面试宝典》《数据库管理员面试笔试宝典》《前端程序员面试笔试宝典》Java《Java编程思想》《Java8》《J...