菜鸟的自学之路

问题描述解题思路实现代码class Solution { public: int minNumberInRotateArray(vector<int> rotateArray) { int length = rotateArray.size(); if(length == 0) { return 0; } i

问题描述解题思路注意这个题目中的几个陷阱 1. 次方为负数的情况 2. 次方为0的情况 3. 返回值为double类型实现源码class Solution { public: double Power(double base, int exponent) { double result = 1; if (exponent == 0)

问题描述解题思路实现源码class Solution { public: int jumpFloorII(int number) { int f[99999]; f[0] = 1; f[1] = 2; for (int i = 2; i < number; i++) { f[i] = 2 * f[i-1];

问题描述解题思路实现源码class Solution { public: int jumpFloor(int number) { long long f[50]; f[0] = 1; f[1] = 2; if(number <= 2) return f[number-1]; for(int i

问题描述解题思路实现源码/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : * val(x), next(NULL) { * } * }; */ class Solution { public: ve

问题描述解题思路实现源码/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : * val(x), next(NULL) { * } * }; */ class Solution { public: ve

问题描述解题思路实现源码/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : * val(x), next(NULL) { * } * }; */ class Solution { public: ve

问题描述解题思路实现源码class Solution { public: void replaceSpace(char *str,int length) { char temp[999999]; int i = 0; int j = 0; while(i<length) { if(str[i] != '

问题描述解题思路实现源码class Solution { public: bool Find(int target, vector<vector<int> > array) { int row = array.size(); int line = array[0].size(); int i = row - 1; int j =

问题描述解题思路实现源码class Solution { public: int rectCover(int number) { long long f[50]; f[0] = 1; f[1] = 2; if(number <= 2) return f[number-1]; for(int i

问题描述解题思路实现源码class Solution { public: int NumberOf1(int n) { int count = 0; while(n) { count ++; n = (n - 1) & n; } return count; }