m0_55124878的博客

剑指 Offer II 001. 整数除法 //方法一： class Solution { public: int divide(int a, int b) { // 考虑被除数为最小值的情况 if (a == INT_MIN) { if (b == 1) { return INT_MIN; } if (b == -1) { ret

剑指 Offer 09. 用两个栈实现队列 class CQueue { public: stack <int> headStack; stack <int> rearStack; CQueue() { } void appendTail(int value) { headStack.push(value); } int deleteHead() { if