Hey Technotrons!
You still haven't been able to figure this one out yet :-)
int remove_duplicates(int * p, int size)
{
int current, insert = 1;
for (current=1; current < size; current++)
if (p[current] != p[insert-1])
{
p[insert] = p[current];
current++; insert++;
}
else current++;
return insert;
}
Showing posts with label crack the code. Show all posts
Showing posts with label crack the code. Show all posts
Tuesday, June 3, 2008
Wednesday, May 21, 2008
What are we aiming to accomplish with this code?
int remove_duplicates(int * p, int size)
{
int current, insert = 1;
for (current=1; current < size; current++)
if (p[current] != p[insert-1])
{
p[insert] = p[current];
current++; insert++;
}
else current++;
return insert;
}
{
int current, insert = 1;
for (current=1; current < size; current++)
if (p[current] != p[insert-1])
{
p[insert] = p[current];
current++; insert++;
}
else current++;
return insert;
}
Subscribe to:
Posts (Atom)