Description 分为两种attack: 1)Code Injection Attacks 2)Return-Oriented Programming 由于executable program的执行逻辑是要上传到CMU评分系统，我们自己本地做的时候要在comm
Description csapp bomb lab. We are given an object file named bomb. We have six bombs to defuse. command objdump objdump -d bomb > bomb.dump readelf -x .rodata bomb 可以查看object file中的data segment，包含所有的static va
Topological Sort Topological Sort 是directed graph中解决precedence-constrained-scheduling 问题比较经典的算法。算法核心在于
Description Solution 解题关键在于将字符串连接起来，相连接的字符串lexicographically排序 使用Union Find + PriorityQueueue Union Find 连接字符串，创建一个Map&l
Leetcode 742. Closest Leaf in a Binary Tree solution 第一种方法考虑使用gragh和dfs,对每一个结点建立一个[currentNode, ParentNode, LeftNode, RightNode]的adjece
leetcode 91. Decode Ways A message containing letters from A-Z is being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given a non-empty string containing only digits, determine the total number of ways to decode it. The answer is guaranteed to fit in a 32-bit integer. Example 1: Input: s = “12” Output: 2 Explanation: It could be decoded as “AB”
LRU(Least Recent Used) LRU是操作系统的一种cache algorithm 实际生产中也可能被应用到。想象一下公司业务要求对于频繁查询的信息(从DB中取值)存储在Hash Tab