fendou123kaixin的专栏

#includeusing namespace std;int search(int arry[],int begin, int end,int target){ int mid = (begin + end)/2; if(arry[mid] == target) return mid; else if (arry[mid] < target) searc

KMP算法短短几行，却比较难理解，今天刷题碰到了，研究了一下午，拿出来跟大家分享一下比如判断ABCE是不是ABCDABCFABCD的字串普通的思路是

class Rotation {public: bool chkRotation(string A, int lena, string B, int lenb) { // write code here if(lena != lenb) return true; string C; C = A + A

void add(char a[], char b[]){ /*********************装换*********************/ int num1[LEN]; int num2[LEN]; for (int i = 0; i < LEN; i++){ num1[i] = 0; num2[i] = 0; } int lena = strlen(a); i

void mul(char a[], char b[]){/****************装换****************/ int num1[LEN]; int num2[LEN]; for (int i = 0; i < LEN; i++){ num1[i] = 0; num2[i] = 0; } int lena = strlen(a); int lenb =

void mod(char a[],int mod){ ///****************装换****************/ //int num1[LEN]; //int num2[LEN]; //for (int i = 0; i < LEN; i++){ // num1[i] = 0; // num2[i] = 0; //} int lena = strlen(a);

这个程序比较多，但是思路很简单，只要求取大数减小数，如果是小数减大数，转换成大数减小数，输出负号void sub(char a[], char b[]){ int alen = strlen(a); int blen = strlen(b); int num1[LEN]; int num2[LEN]; for (int i = 0; i < LEN; i++){ num1[i]

#include#include#define LEN 100using namespace std;void add(char a[], char b[]){ /*********************装换*********************/ int num1[LEN]; int num2[LEN]; for (int i = 0; i < LEN; i++){

bool IsExitLoop(ListNode *head){ if(head == NULL) return false; ListNode *fast,*low; fast = low = head; while(fast && fast->next != NULL){ fast = fast->next->next; low = low->next; if(fas