CareerCup

this is mine: O(n) and in-place:
step1: reverse it;
step2: deal with it word by word;
time: O(n)

void mfunc(char *s, int size){
int ms=0, md=size-2;
char mc;
while(ms<md){
mc=s[ms];
s[ms]=s[md];
s[md]=mc;
ms++;
md--;
}
ms=0;
md=size-2;
int mstart, mend;
while(1){
while((ms<=md)&&(s[ms]==’ ‘))ms++;
if(ms>md)break;
mstart=ms;
while((ms<=md)&&(s[ms]!=’ ‘))ms++;
mend=ms-1;
while(mstart<mend){
mc=s[mstart];
s[mstart]=s[mend];
s[mend]=mc;
mstart++;
mend--;
}
}
}

Keep each word in node of a linked list.
Reverse the linked list.

i have seen this question for several times in this forum.
a good solution:
reverse whole string,
then reverse each word in the string.

e.x: "how are you"
step 1: "how are you" --> "uoy era woh"
step 2: "uoy era woh" --> "you are how"

String src = "How are you";
Stack<String> stk = new Stack<String>();
String[] split = src.split(" ");
for (int j = 0; j < split.length; j++) {
	stk.push(split[j]);
}
		
for(String s: stk){
	System.out.println(s);
}

if you don't have puzzles so why you invest your site give me a answer right now?

if you don't have puzzles so why you invest your site give me a answer right now?