wyj7260的专栏

#include #include using namespace std;typedef struct ListNode { int data; struct ListNode * next; ListNode(int d) : data(d), next(NULL){}};ListNode *initList() { ListNode * head = NULL;

#include using namespace std;bool ifHasNum(int *data,int row, int col, int num){ if(data == NULL || row <= 0 || col <= 0){ return false; } int i = 0; int j = col - 1; while(i = 0){ if(nu

#includeusing namespace std;bool isValid = true;bool isPositive = true;bool doubleEqual(double number1, double number2) { if(number1 - number2 -0.0000001) { return true; } else { return

#include#include#include using namespace std;long long fibRecursion(unsigned n) { if(n <= 0) { return 0LL; } if(n == 1) { return 1LL; } if(n >= 2) { return fibRecursion(n - 1) +

#includeusing namespace std;int main() { unsigned int number = 9; cout<<"number:"<<number<<endl; int count_one = 0; while(number) { count_one++; number = number & (number - 1); }

#include #include using namespace std;typedef struct ListNode { int data; struct ListNode * next; ListNode(int d) : data(d), next(NULL){}};ListNode *initList(int *array, unsigned int lengt

#include #include using namespace std;bool isValid = true;int FindGreatestSumOfSubArray(int *data, int length) { isValid = true; if (data == NULL || length == 0) { isValid = false; return

#include #include using namespace std;typedef struct ListNode { int data; struct ListNode * next; ListNode(int d) : data(d), next(NULL){}};ListNode *initList(int *array, unsigned int lengt

/**Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u