then we can do it using queue.we keep on adding elements to the queue until we encountered delimiter.once a delimiter is encountered we just add a space in the queue ans skip all the delimiters...the process has to be repeated till we reach end of string
@Trent yes your code will work fine except the case when string ends with multiple delimiter then in that case you will never enter else statement.so you should put count condition at the end before adding str[z]='\0'.please check..:)
Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
delimiters includes just spaces and tab?
ReplyDelete@anonymous you can consider it to include just spaces and tab..:)
ReplyDeletethen we can do it using queue.we keep on adding elements to the queue until we encountered delimiter.once a delimiter is encountered we just add a space in the queue ans skip all the delimiters...the process has to be repeated till we reach end of string
ReplyDelete@anonymous this should be done in a single parsing without using any extra space..:)
ReplyDeleteUsing counter :
ReplyDeletechar *remove_ts(char *str)
{
int i,z,count;
for(count=i=z=0;str[i];i++){
if(str[i]=='\t'||str[i]==' ')
count++;
else{
if(count){
str[z]=' ';
z++;
}
str[z]=str[i];
z++; count=0;
}
}
str[z]='\0';
return str;
}
@Trent yes your code will work fine except the case when string ends with multiple delimiter then in that case you will never enter else statement.so you should put count condition at the end before adding str[z]='\0'.please check..:)
ReplyDeleteyes i forgot that the last can be a space!
ReplyDeletehere a fix before str[z]='\0' :
if(str[i-1]==' '){str[z]=' '; z++;}