Exemplo n.º 1
0
int main() {

    int nums0[] = { 1, 2, 0 };
    int nums1[] = { 3, 4, -1, 1 };
    int nums2[] = { -1, 4, 2, 1, 9, 10 };
    int nums3[] = { 1, 1 };

    assert(firstMissingPositive(nums0, sizeof(nums0) / sizeof(nums0[0])) == 3);
    assert(firstMissingPositive(nums1, sizeof(nums1) / sizeof(nums1[0])) == 2);
    assert(firstMissingPositive(nums2, sizeof(nums2) / sizeof(nums2[0])) == 3);
    assert(firstMissingPositive(nums3, sizeof(nums3) / sizeof(nums3[0])) == 2);

    printf("all tests passed!\n");

    return 0;
}
Exemplo n.º 2
0
int main(){
    int a[]={3,4,3,1};
    int len = sizeof(a)/sizeof(int);
    printf("%d\n",firstMissingPositive(a, len));
    for(int i=0;i<len;++i) printf("%d ",a[i]);
    printf("\n");
    return 0;
}
Exemplo n.º 3
0
int main(int argc, char *argv[])
{
	int nums[] = {1};
	int numsSize = sizeof(nums) / 4;
	int ret = firstMissingPositive(nums, numsSize);
	printf("%d\n", ret);

	return 0;
}
Exemplo n.º 4
0
Arquivo: 41.c Projeto: unasm/utils
int main(int argc, const char *argv[])
{
	//int nums[] = {-1,3,1,4}, size = 4, exp = 2;
	//int nums[] = {3, 4 ,1, -1}, size = 4, exp = 2;
	//int nums[] = {3,3,1,4,0}, size = 5, exp = 2;
	int nums[] = {0,2,2,4,0,1,0,1,3}, size = 9, exp = 5;
	// 0 0 0 1 1 2 2 3 4
	//int nums[] = {3,4, -1,1}, size = 4, exp = 2;
	//int nums[] = {-1,3,2,1,4}, size = 5, exp = 5;
	int got = firstMissingPositive(nums, size)	;
	printf("got %d\n", got);
	return 0;
}
int main() {
	int nums[5] = { 1, 0 };
	printf("%d\n", firstMissingPositive(nums, 2));
	return 0;
}
Exemplo n.º 6
0
int main() {
	int a[] = {3,4,-1,1};
	printf("%d\n", firstMissingPositive(a, 4));
	return 0;
}
Exemplo n.º 7
0
int main() {
    int a[] = {1,2,0};
    vector<int> b = arrayToVector(a);
    cout<<firstMissingPositive(b)<<endl;
    return 0;
}
Exemplo n.º 8
0
int main(void)
{
	int	a[] = { 1, 1 };
	printf("%d\n", firstMissingPositive(a, sizeof(a) / sizeof(a[0])));
	return(0);
}