0

Question is :
Write a function

int f(char* str, long pattern)

to find out how many pattern does the str contain? str is a char array consist of '1' and '0';
for example: str = "11010101110101011110100011001" ,pattern = 110;

My solution is change pattern and str to std::string, then use std::string::find to search.
but I think this solution is not efficient.

1.Could you tell me other efficient solution? thanks.

2. if the second parameter is a array, how to optimize it?

Thank you very much!

3
Contributors
4
Replies
5
Views
9 Years
Discussion Span
Last Post by vijayan121
0

>but I think this solution is not efficient.
Why? If you're just guessing or using your "programmer's intuition", you're probably wrong. Interviewers (good ones) tend to smile more on people who aren't afraid to say "I'd rather optimize clean, correct code than fix fast code". That's the sign of an experienced programmer.

0

Thank you!

I don't know the answer of the second question: if pattern is a array, how to optimize it?

0

>I don't know the answer of the second question:
>if pattern is a array, how to optimize it?
The answer is the same.

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.