reverse_words_in_a_string

hitzzc · hitzzc · commit d6d35bfdeac7 · 2016-10-14T12:22:15.000+08:00
diff --git a/README.md b/README.md
@@ -134,6 +134,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [148. sort list](https://github.com/hitzzc/go-leetcode/tree/master/sort_list)
 #### [149. Max Points on a Line](https://github.com/hitzzc/go-leetcode/tree/master/max_points_on_a_line)
 #### [150. evaluate reverse polish notation](https://github.com/hitzzc/go-leetcode/tree/master/evaluate_reverse_polish_notation)
+#### [151. reverse words in a string](https://github.com/hitzzc/go-leetcode/tree/master/reverse_words_in_a_string)
 
 
 
diff --git a/reverse_words_in_a_string/reverse_words_in_a_string.cpp b/reverse_words_in_a_string/reverse_words_in_a_string.cpp
@@ -0,0 +1,32 @@
+#include <string>
+#include <iostream>
+#include <vector>
+using namespace std;
+
+class Solution {
+public:
+	void reverseWords(string &s) {
+		vector<string> words;
+		bool found = false;
+		int start = -1;
+		const char space = ' ';
+		for (int i = 0; i < s.size(); ++i){
+			if (found && s[i]==space){
+				words.push_back(s.substr(start, i-start));
+				found = false;
+			}else if (!found && s[i]!=space){
+				start = i;
+				found = true;
+			}
+		}
+		if (found) words.push_back(s.substr(start));
+		s.clear();
+		if (words.empty()) return;
+		for (int i = words.size()-1; i > 0; --i){
+			s += words[i];
+			s.push_back(space);
+		}
+		s += words[0];
+		return;
+	}
+};
