64,073
社区成员
发帖
与我相关
我的任务
分享
int search(int* nums, int numsSize, int target){
for(int i = 0;i <numsSize ;i++){
if(nums[i]==target){
return i;
}
}
return -1;
}
bool search(int* nums, int numsSize, int target){
for(int i = 0;i <numsSize ;i++){
if(nums[i]==target){
return true;
}
}
return false;
}
int findMin(int* nums, int numsSize){
int min=5000;
for(int i = 0;i <numsSize;i++){
if(nums[i]<min){
min = nums[i];
}
}
return min;
}
int climbStairs(int n){
int f[1000];
f[0] = f[1] =1;
for(int i=2;i<=n;i++){
f[i]=f[i-1]+f[i-2];
}
return f[n];
}
int fib(int n){
int f[31];
f[0]=0;
f[1]=1;
for(int i = 2; i <= n;i++){
f[i] = f[i-1]+f[i-2];
}
return f[n];
}
int tribonacci(int n){
int f[38];
f[0]=0;
f[1]=1;
f[2]=1;
for(int i = 3; i <= n;i++){
f[i] = f[i-1]+f[i-2]+f[i-3];
}
return f[n];
}
int countKDifference(int* nums, int numsSize, int k){
int anc=0;
for(int i = 0;i<numsSize;i++){
for(int j=i+1;j<numsSize;j++)
{
if(abs(nums[i]-nums[j])==k){
anc++;
}
}
}
return anc;
}
int game(int* guess, int guessSize, int* answer, int answerSize){
int cis=0;
for(int i =0;i<3;i++){
if(guess[i]==answer[i]){
cis++;
}
}
return cis;
}
int minCount(int* coins, int coinsSize){
int cis = 0;
for(int i = 0;i<coinsSize;i++){
cis += ((coins[i]+1)/2);
}
return cis;
}