摘要：
class Solution {public: int FindGreatestSumOfSubArray(vector<int> array) { int maxNum =0x80000000; int curNum = 0; for(int i=0; i<array.size(); i++) { 阅读全文
摘要：
class Solution {public: int MoreThanHalfNum_Solution(vector<int> numbers) { if(numbers.empty()) return 0; int count =0; int midVal =0; int tobesorted 阅读全文
摘要：
class Solution {public: int GetUglyNumber_Solution(int index) { //变量定义区 int subA=0, subB=0, subC=0; int sub =0; int* array = new int[index]; array[0] 阅读全文