两数之和
暴力
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int *twoSum(int *nums , int numsSize , int target , int *returnSize)
{
int i = 0 , j = 0;
*returnSize = 2;
int *a = (int *)malloc(sizeof(int)*2);
for(i = 0;i<numsSize;i++)
for(j=i+1;j<numsSize;j++)
if(nums[i] + nums[j] == target)
{
a[0] = i;
a[1] = j;
return a;
}
return a;
}
*returnSize=2;没有会导致输出为[。
136只出现一次的数字
int singleNumber(int* nums, int numsSize){
int a,b,c;
for(a=0;a<numsSize;a++){
int count=0;
for(b=0;b<numsSize;b++){
if(nums[a]==nums[b]&&a!=b)
count++;
}
if(count==0)
c=nums[a];
}
return c;
}