TiuTiu Zone

#include //常规解法，求余运算比较耗时可优化 int countV1(int num){ int result = 0; while (num){ if (num % 2) result++; num /= 2; } return result; } //用位运算优化 int countV2(int num){ int result = 0; while

#include #define SIZE 100 //将一个size元一维向量vector向左旋转bits个位置 void rotateV1(char vector[], int size, int bits){ //消耗辅助空间 char stack[SIZE]; int top = 0; int i; for (i = 0; i < bits; i++) stack[to

#include int maxSubArrayV1(int array[], int size){ int maxSum = 0; int start, end; for (start = 0; start < size; start++) for (end = start; end < size; end++){ int sum = 0; int i; for

#include void printArray(int array[], int size){ int i; for (i = 0; i < size; i++) printf("%d ", array[i]); printf("\n"); } void swap(int *a, int *b){ int temp = *a; *a = *b; *b = temp; } v

/*求两个数的最大公约数（greatest common divisor）*/ #include void swap(int *a, int *b){ int c = *a; *a = *b; *b = c; } //辗转相处法迭代写法 int GCD_V1(int divident, int divisor){ int mod; while ( (mod = divident

/* 物品只有放进背包和不放进背包两种选择，枚举所有可能的组合，复杂度是O(2^numOfItems) */ #include #define MAX_ITEMS 101 #define MAX_WEIGHT 101 int weight[MAX_ITEMS]; int value[MAX_ITEMS]; int weightLimit; int numOfItems; int result;

/* 动态规划*/ #include #define MAX_ITEMS 101 #define MAX_WEIGHT 101 int weight[MAX_ITEMS]; int value[MAX_ITEMS]; int weightLimit; int numOfItems; int result; int maxValue[MAX_ITEMS][MAX_WEIGHT]; void c

int binarySearchValueIteratively(int array[], int size, int value){ int left = 0; int right = size - 1; //为了防止（left + right）溢出，所以先算（right - left），并用移位操作加速，注意">>"优先级很低 int mid = left + ( (right -