会飞的猪的博客

/*struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { }};*/class Solution {public:ListNode* FindKthToTail(ListNode* p, unsigned i...

解法一：class Solution {public: double Power(double base, int exponent) { double ans = 1; if(exponent == 0){ return ans; }else if(exponent > 0){ ...

解法一：举例比较好理解，假设n为5，其二进制为b1 = 00000000 00000000 00000000 00000101，将其减去1，二进制变为b2 = 00000000 00000000 00000000 00000100，此时令n = b1 & b2 为00000000 00000000 00000000 00000100，此时n相比b1消去了一个1，如此往复，直到所有1都...

#include int GCD(int a, int b){    if(a         return GCD(b,a);    }    if(b == 0){        return a;    }    else{        return GCD(b, a % b);    }} int main (){    i

https://www.cnblogs.com/double-t/p/11151461.html默写了一下# class Tree():# def __init__(self,x):# self.value=x# self.left=None# self.right=None# class Solution():...

# -*- coding:utf-8 -*-from IPython.core.interactiveshell import InteractiveShellInteractiveShell.ast_node_interactivity = "all"class stack(): def __init__(self,data): if data == None:...