kunpeng

2.1 信息的存储通常情况下，程序将内存视为一个非常大的数组，数组的元素是由一个个的字节Byte组成，每个字节都有一个唯一的数字来表示，称为地址address，所有地址的集合称为虚拟地址空间 2.1.1 进制1个字节由8个位bit组成，用十

2021-11-20 CS

CSAPP

1.2 操作系统无论是shell程序还是hello程序，都没有直接访问键盘、显示器、磁盘等硬件设备，真正操控硬件的是操作系统，可以把操作系统看成是应用程序和硬件之间的中间层，所有应用程序对硬件的操作必须通过操作系统来完成为了实现上述功能

2021-11-20 CS

CSAPP

1.1 hello程序1.1.1 编译系统如何工作#include <stdio.h> int main() { printf("hello,world\n"); return 0; } 编写一个

2021-11-20 CS

CSAPP

LeetCode 120. TriangleLeetCode-120 Given a triangle array, return the minimum path sum from top to bottom. For each step

2021-11-06 LeetCode

动态规划

LeetCode 118. Pascal’s TriangleLeetCode-118 Given an integer numRows, return the first numRows of Pascal’s triangle. In

2021-11-06 LeetCode

动态规划

LeetCode 114. Flatten Binary Tree to Linked ListLeetCode-114 Given the root of a binary tree, flatten the tree into a &q

2021-11-05 LeetCode

二叉树

LeetCode 96. Unique Binary Search TreesLeetCode-96 Given an integer n, return the number of structurally unique BST’s (b

2021-11-04 LeetCode

动态规划

LeetCode 343. Integer BreakLeetCode-343 Given an integer n, break it into the sum of k positive integers, where k >=

2021-11-04 LeetCode

动态规划

LeetCode 62. Unique PathsLeetCode-62 A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the di

2021-11-04 LeetCode

动态规划

LeetCode 70. Climbing StairsLeetCode-70 You are climbing a staircase. It takes n steps to reach the top. Each time you c

2021-11-04 LeetCode

动态规划

LeetCode 138. Copy List with Random PointerLeetCode-138 A linked list of length n is given such that each node contains

2021-11-02 LeetCode

哈希表链表

LeetCode 116. Populating Next Right Pointers in Each NodeLeetCode-116 You are given a perfect binary tree where all leav

2021-11-02 LeetCode

二叉树