原创 【操作系統】Orange‘s學習筆記(二) 第三章1 認識保護模式
文章目錄3.1 認識保護模式1. 實模式跳轉到保護模式(1) 具體代碼和實驗(2) 詳細分析2. 保護模式的運行環境3. GDT(Global Descriptor Table)(1) 32位PC機的工作模式(2) 從實模式到保護
2020-07-05 13:19:06
2
原创 【操作系統】Orange‘s學習筆記(一)
文章目錄一、工作環境和準備工作二、第一章 馬上動手寫一個最小的“操作系統”1. 第一章筆記2. nasm學習3. 實際操作三、第二章 搭建你的工作環境1. bochs安裝和使用步驟2. bochs調試操作系統 一、工作環境和準備工
2020-07-04 03:22:50
8
原创 LeetCode C++ 67. Add Binary【Math/String】簡單
Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contain
2020-07-01 15:12:53
原创 【算法學習】Bit Algorithms 總結2
文章目錄1. 高效判斷一個數是否是3的倍數 Check if a integer is multiple of 3 efficently(1) 題意(2) 思路(3) 模板代碼2. 快速乘7 Efficient method to
2020-07-01 15:12:53
294
原创 LeetCode C++ 62. Unique Paths【動態規劃/排列組合】中等
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only
2020-07-01 15:12:51
20
原创 LeetCode C++ 633. Sum of Square Numbers【Math】簡單
Given a non-negative integer c, your task is to decide whether there’re two integers a and b such that a2+b2=ca^2 +
2020-07-01 15:12:51
原创 LeetCode C++ 389. Find the Difference【位操作】簡單
Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string
2020-07-01 15:12:51
原创 LeetCode C++ 139. Word Break【Dynamic Programming】中等
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be se
2020-07-01 15:12:51
原创 LeetCode C++ 1232. Check If It Is a Straight Line 【Geometry/Math】簡單
You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Che
2020-07-01 15:12:51
原创 LeetCode C++ 215. Kth Largest Element in an Array【堆/分治】中等
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not
2020-07-01 15:12:51
1
原创 LeetCode C++ 63. Unique Paths II【動態規劃】中等
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only
2020-07-01 15:12:51
原创 LeetCode C++ 209. Minimum Size Subarray Sum【二分/滑窗/雙指針】中等
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of
2020-07-01 15:12:51
18
原创 LeetCode C++ 155. Min Stack【Stack】簡單
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push e
2020-07-01 15:12:51
原创 LeetCode C++ 41. First Missing Positive【Array】困難
Given an unsorted integer array, find the smallest missing positive integer. Example 1: Input: [1,2,0] Output: 3 E
2020-07-01 15:12:51
原创 LeetCode C++ 718. Maximum Length of Repeated Subarray【Dynamic Programming】
Given two integer arrays A and B , return the maximum length of an subarray that appears in both arrays. Example 1:
2020-07-01 15:12:51