SRM 698, D2, 250-Pointer (Initials)

James S. Plank

Sun Sep 18 22:59:27 EDT 2016
Take a look at the constraints, and you'll see that there are no tricks in this problem. The return value is going to be a string composed of the first character in names, and then every character that follows a space. So, push_back() the first character in names, and then traverse names, and every time you see a space, you push_back() the next character.
My solution.