Y673582465的专栏

#include using namespace std;int fibonacci_recursive(int a){ int sum; if(a 0) return -1; else if((a == 1) || (a == 2)) return 1; else s

#include using namespace std;typedef int ElementType;int binarySearch_recursive(ElementType a[], ElementType e, int begin, int end){ if(begin > end) return -1;// int midIndex = (begin

void hanoi(int n, char A, char B, char C){ if(n == 1) printf("move %d from %c to %c\n",n,A,C);//步骤2：将A中最后一个盘子从A直接移至C else { hanoi(n-1,A,C,B);//步骤1：将A中最上面n-1个盘子从A通过C移至B

#include using namespace std;//此种方法只能用于小数阶乘long long factorial(int n){ return (n 0) ? -1 : ((n == 0) ? 1 : n * factorial(n-1));}void main(){ cout 25) << endl;}

void swap(int *p1,int *p2){ int *p = (int*)malloc(sizeof(int)); *p = *p1; *p1 = *p2; *p2 = *p;}void main(){ //不借助其他变量 int i = 4, j = 5; i = i+j; j = i-j; i = i-j;

int numTable[256] = {0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3,3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3,4, 3, 4, 4, 5, 3, 4, 4, 5,

public class GCD { static int m, n, temp; public static void swap() { if (m < n) { temp = m; m = n; n = temp; } } // 方法一；欧几里得辗转相除法

#define bits(x) sizeof(x)*8void decToBin(short x){ int temp[bits(x)]; int num = bits(x); if(x < 0) { x = -x; printf("-"); } for(int i = 0; i < num; i++) {

list.h#ifndef _LIST_H_#define _LIST_H_#include&lt;iostream&gt;using namespace std;class List;class Node{ private: int value; Node *next; public: Node() {

C++综合系列之模拟栈模版（链表版）

#include iostream>using namespace std;typedef struct biTreeNode{ char data; struct biTreeNode *lChild; struct biTreeNode *rChild;}biTreeNode, *biTreePtr;//创建void create_preOrder_pt

堆栈模拟数学表达式

typedef int ElementType;void printArray(ElementType num[], int count){ for(int i = 0; i count; i++) cout << num[i]; cout << endl;}void swap(ElementType &a, ElementType &b){