原创 657. Judge Route Circle
Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, whic
2020-02-25 13:56:47
原创 530. Minimum Absolute Difference in BST
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two no
2020-02-25 13:56:47
原创 257. Binary Tree Paths
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3
2018-08-27 23:27:48
2
原创 572. Subtree of Another Tree
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a
2018-08-27 23:27:45
原创 ucore lab2 實驗報告
ucore lab2 實驗報告 練習0：填寫已有實驗 本實驗依賴實驗1.請把你做的實驗1的代碼填入本實驗中代碼中有“LAB1”的註釋相應部分。提示：可採用diff和patch工具進行半自動的合併（merge），也可用一些圖形化的比較/m
2018-08-27 23:27:43
14
原创 ucore lab1實驗報告
ucore lab1實驗報告 練習1 理解通過 make 生成執行文件的過程。(要求在報告中寫出對下述問題的回答) 在此練習中,大家需要通過閱讀代碼來了解: 1）操作系統鏡像文件 ucore.img 是如何一步一步生成的?(需要比較
2018-08-27 23:27:43
原创 101. Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binar
2018-08-27 23:27:43
原创 SSDT Hook實現內核級的進程保護
目錄 SSDT Hook效果圖SSDT簡介SSDT結構SSDT HOOK原理Hook前準備如何獲得SSDT中函數的地址呢SSDT Hook流程SSDT Hook實現進程保護Ring3與Ring0的通信如何安裝啓動停止卸載服務參考文獻源碼
2018-08-27 23:27:42
7
原创 啓動、中斷、異常和系統調用
3.1 計算機的啓動流程 下圖表示了計算機啓動時所執行的四個步驟。下面將按照四個步驟更詳細的描述。 3.1.1 系統加電，BIOS初始化硬件 1.從系統加電到CPU執行第一條指令 FFFFH：0000H指向的指令是一條跳轉指令，跳到系
2018-08-27 23:27:42
原创 230. Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assu
2018-08-27 23:27:42
原创 199. Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ord
2018-08-27 23:27:41
1
原创 645. Set Mismatch
The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in th
2018-08-27 23:27:41
原创 108. Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 我的解答： /** * D
2018-08-27 23:27:41
4
原创 671. Second Minimum Node In a Binary Tree
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree ha
2018-08-27 23:27:41
原创 111. Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the
2018-08-27 23:27:41