llllmz

摘要： int max(int i,int j){ if(i>j) return i; return j; } int candy(int* ratings, int ratingsSize) { int* left=(int*)malloc(sizeof(int)*ratingsSize); int* r 阅读全文

摘要： int canCompleteCircuit(int* gas, int gasSize, int* cost, int costSize) { int sum=0,n=gasSize; for(int i=0;i<n;i++){ gas[i]=gas[i]-cost[i]; sum+=gas[i] 阅读全文

摘要： int largestSumAfterKNegations(int* nums, int numsSize, int k) { int t[201]={0}; int sum=0; for(int i=0;i<numsSize;i++){ sum+=nums[i]; t[nums[i]+100]++ 阅读全文

摘要： int max(int i,int j){ if(i>j) return i; return j; } bool canJump(int* nums, int numsSize) { if(numsSize==1) return true; if(nums[0]==0) return false; 阅读全文

摘要： int max(int i,int j){ if(i>j) return i; return j; } int maxProfit(int* prices, int pricesSize) { int** dp=(int**)malloc(sizeof(int*)*pricesSize); for( 阅读全文

摘要： int max(int i,int j){ if(i>j) return i; return j; } int maxSubArray(int* nums, int numsSize) { int* dp=(int*)malloc(sizeof(int)*numsSize); dp[0]=nums[ 阅读全文

摘要： int max(int i,int j){ if(i>j) return i; return j; } int wiggleMaxLength(int* nums, int numsSize){ int** dp=(int**)malloc(sizeof(int*)*numsSize); for(i 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文