Tech
二〇二二
二〇二一
二〇二〇
二〇一九
- MIT6.828 | hw5: xv6 system calls 【待填坑 dup2】
- MIT6.828 | Lec 5: Isolation mechanisms
- MIT6.828 | Lec4: Shell & OS organization
-
- 受标签影响的最大值 - Largest Values From Labels
- MIT6.828 | Lab 2: Memory Management
- MIT6.828 | Lab 2: Memory Management - Part 3: Kernel Address Space
- MIT6.828 | Lab 2: Memory Management - Part 2: Virtual Memory
- MIT6.828 | Lab 2: Memory Management - Part 1: Physical Page Management
- 译 | 6.4 页面级保护
- MIT6.828 | Lab 1: Booting a PC
- 译 | 5.2 页面翻译 - Page Translation
- MIT6.828 | Hw-3: Shell 【待填坑】
- 译 | pipe, fork & dup: 理解命令执行和输入输出流
-
- 二进制矩阵中的最短路径 - Shortest Path in Binary Matrix
-
- 重复0 - Duplicate Zeros
- MIT6.828 | Lec2: x86 and PC architecture
- MIT6.828 | Lab 1: Booting a PC - Part 3: The Kernel
- MIT6.828 | Lab 1: Booting a PC - Part 2: The Boot Loader
- MIT6.828 | Lab 1: Booting a PC - Part 1: PC Bootstrap
- 笔记 | Stanford CS49n 学习笔记:0 - blink 【LED闪烁】
- 美化 | 为 WSL 配置 Hyper.js + Oh My ZSH + Angoster主题
- Project | 单周期CPU报告
- 数据库 | 数据库系统概念及架构-Database System Concepts and Architecture
- 数据库 | 数据是什么 - Data: What is it?
- 算法 | 网络流 - Network Flow
- 算法 | 动态规划 - Dynamic Programming
- 算法 | 分治 - Divide and Conquer
- 算法 | 贪心算法 - Greedy Algorithm
- 算法 | 图 - Graph
- 算法 | 稳定匹配 - Stable Matching
- Parallel Processors from Client to Cloud
- Virtual Memory
- Memory Performance and Dependable Memory Hierarchy
- Large and Fast: Exploiting Memory Hierarchy
-
- 范围内的数字计数 - Digit Count in Range
-
- 不动点 - Fixed Point
-
- 字符串的索引对 - Index Pairs of a String
- Instruction-Level Parallelism
- The Overview of Pipeline
-
- 分隔数组以得到最大和 - Partition Array for Maximum Sum
-
- 不邻接植花 - Flower Planting With No Adjacent
-
- 困于环中的机器人 - Robot Bounded In Circle
-
- 最后一块石头的重量 II - Last Stone Weight II
-
- 删除字符串中的所有相邻重复项 - Remove All Adjacent Duplicates In String
-
- 交换一次的先前排列 - Previous Permutation With One Swap
- 音乐数据库系统设计及主要操作介绍
-
- 最长字符串链 - Longest String Chain
-
- 最后一块石头的重量 - Last Stone Weight
-
- 距离相等的条形码 - Distant Barcodes
-
- 爱生气的书店老板 - Grumpy Bookstore Owner
- 1051.高度检查器-Height Checker
- 折腾 | 记录一次网站宕机 | 谷歌云 SSH故障
-
- 对称二叉树 - Symmetric Tree
-
- 不同路径 - Unique path
-
- 二叉树的中序遍历 - Binary Tree Inorder Traversal
-
- 整数反转 - Reverse Integer
-
- 两数和 - Two Sum
-
- 最低票价 - Minimum Cost For Tickets
-
- 最接近原点的K个点 - K Closest Points to Origin
-
- 最长湍流子数组 - Longest Turbulent Subarray
-
- 翻转二叉树以匹配先序遍历 - Flip Binary Tree To Match Preorder Traversal
-
- 强整数 - Powerful Integers
-
- 二叉树的完全性检验 - Check Completeness of a Binary Tree
-
- 煎饼排序 - Pancake Sorting
-
- 三数之和的多种可能 - 3Sum With Multiplicity
-
- 朋友圈 - Friend Circles
-
- 按奇偶排序数组 II - Sort Array By Parity II
-
- 戳气球 - Burst Balloon
-
- 最大子序和 - Maximum Subarray
-
- 监控二叉树 - Binary Tree Cameras
-
- 连续差相同的数字 - Numbers With Same Consecutive Differences
-
- 单值二叉树 - Univalued Binary Tree
-
- 救生艇 - Boats To Save People
-
- 二叉树的后序遍历 - Binary Tree Postorder Traversal
-
- 二叉树中的最大路径和 - Binary Tree Maximum Path Sum
-
- 二叉树的层次遍历 - Binary Tree Level Order Traversal
- 005.最长回文串-Longest Palindromic Substring
-
- 翻转二叉树以匹配先序遍历 - Flip Binary Tree To Match Preorder Traversal
- Ubuntu 18.04 LTS 安装 Node.js
- Ubuntu 18.04 LTS 安装 Hexo