Ok, this is driving me mad. The project (from Walt Savitch - Absolute C++) is:
"Write a function called deleteRepeats that has a partially filled array of characters
as a formal parameter and that deletes all repeated letters from the array.
Since a partially filled array requires two arguments, the function will actually
have two formal parameters: an array parameter and a formal parameter of type
int that gives the number of array positions used. When a letter is deleted, the
remaining letters are moved forward to fill in the gap. This will create empty
positions at the end of the array so that less of the array is used. Since the formal
parameter is a partially filled array, a second formal parameter of type int will
tell how many array positions are filled. This second formal parameter will be a
call-by-reference parameter and will be changed to show how much of the array
is used after the repeated letters are deleted. For example, consider the following
code:
char a[10];
a[0] = 'a';
a[1] = 'b';
a[2] = 'a';
a[3] = 'c';
int size = 4;
deleteRepeats(a, size);
After this code is executed, the value of a[0] is 'a', the value of a[1] is 'b', the
value of a[2] is 'c', and the value of size is 3. (The value of a[3] is no longer of
any concern, since the partially filled array no longer uses this indexed variable.)
You may assume that the partially filled array contains only lowercase letters.
Embed your function in a suitable test program."
The best I can come up with is the following, however I realise it only compares adjacent elements, but I need to compare all the elements against all others, I presume:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
|
void deleteRepeats(char myArr[], int& size)
{
int a, b;
int temp = 0;
bool flag;
for(a = 0; a <= size; a++)
{
flag = false;
if(myArr[a] == myArr[a + 1])
{
flag = true;
temp++;
}
if(!flag)
{
for(b = a - temp; b <= size; b++)
{
myArr[b] = myArr[b + temp];
}
}
}
}
|