LeetCode 476. Number ComplementThe complement of an integer is the integer you get when you flip all the 0’s to 1’s and

LeetCode 762. Prime Number of Set Bits in Binary RepresentationGiven two integers left and right, return the count of nu

LeetCode 136. Single NumberGiven a non-empty array of integers nums, every element appears twice except for one. Find th

LeetCode 231. Power of TwoGiven an integer n, return true if it is a power of two. Otherwise, return false. An integer n

LeetCode 279. Perfect SquaresLeetCode-279 Given an integer n, return the least number of perfect square numbers that sum

LeetCode 494. Target SumLeetCode-494 You are given an integer array nums and an integer target. You want to build an exp

LeetCode 509. Fibonacci NumberLeetCode-509 The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibo

指令与条件码条件码寄存器条件码寄存器是由CPU来维护的，长度是1Bit，它描述了最近执行的操作的属性，例如ALU执行两条连续的算术指令 t1: addq %rax, %rbx t2: subq %rcx, %rdx t1时刻执行指令1，t2

算术和逻辑运算指令leaq指令leaq S, D // load effective address q表示地址长度是64位 leaq 7(%rdx, %rdx, 4), %rax // 地址复制到rax中 有效地址的计算方式

栈与数据传送指令在程序的执行过程中，需要在CPU和内存之间进行频繁的数据存取，例如，CPU执行加法c=a+b，首先通过执行数据传送指令将a和b的值从内存读到寄存器内 寄存器就是CPU内的一种数据存储部件，只不过容量比较小，比如，寄存器rax

寄存器与数据传送指令64位的处理器中，原来8个16位寄存器扩展成了64位，还增加了8个 不同寄存器扮演不同的角色，相应的编程规范规定了如何使用这些寄存器 rax用来保存函数的返回值 rsp用来保存程序栈的结束位置 rdi, rsi, r

3.1 程序的机器级表示编写main.c和mstore.c #include <stdio.h> void mulstore(long, long, long*); int main() { long d;