Answer:
The function written in C++
int str(string word)
{
int count = 1;
for(int i =0; i<word.length();i++)
{
if(word[i] == ' ')
{
count++;
}
}
return count;
}
Explanation:
This line defines the function
int str(string word)
{
This line initializes count to 1
int count = 1;
This line iterates through the input string
for(int i =0; i<word.length();i++)
{
This line checks for blank space
if(word[i] == ' ')
{
Variable count is incremented to indicate a word count
count++;
}
}
return count;
}
<em>See attachment for full program</em>
Answer:
word = input("Type your name: ")
print(len(word))
Explanation:
The len function will count all the chars in the string.
Answer:
okay
Explanation:
wats the test about ?
send the topics to help you revise the content
Answer:
One approach would be to move all items from stack1 to stack2 (effectively reversing the items), then pop the top item from stack2 and then put them back.
Assume you use stack1 for enqueueing. So enqueue(x) = stack1.push(x).
Dequeueing would be:
- For all items in stack1: pop them from stack1 and push them in stack 2.
- Pop one item from stack2, which will be your dequeue result
- For all items in stack2: pop them from stack2 and push them in stack 1.
Hope it makes sense. I'm sure you can draw a diagram.
