{"id":2004,"date":"2016-04-22T13:39:52","date_gmt":"2016-04-22T05:39:52","guid":{"rendered":"http:\/\/boweihe.me\/?p=2004"},"modified":"2016-04-22T13:39:52","modified_gmt":"2016-04-22T05:39:52","slug":"leetcode-151-reverse-words-in-a-string","status":"publish","type":"post","link":"https:\/\/dayandcarrot.space\/?p=2004","title":{"rendered":"LeetCode 151. Reverse Words in a String"},"content":{"rendered":"

\u9898\u76ee<\/h3>\n

Given an input string, reverse the string word by word.
\nFor example,
\nGiven s = “the sky is blue<\/code>“,
\nreturn “blue is sky the<\/code>“.
\nUpdate (2015-02-12):<\/span><\/b>
\nFor C programmers: Try to solve it in-place<\/i> in O<\/i>(1) space.<\/p>\n

\u601d\u8def<\/h3>\n

\u4e00\uff01\u5b9a\uff01\u8981\uff01\u8003\uff01\u8651\uff01\u5404\uff01\u79cd\uff01\u60c5\uff01\u51b5\uff01\u6bd4\u5982<\/p>\n

\" \"\/\/\u4e00\u4e2a\u7a7a\u683c\n\"   What am   I doing     \"<\/pre>\n
\u7136\u540e\u8fd9\u79cd\u5012\u8f6c\u95ee\u9898\u7684\u539f\u5730\u5904\u7406\u601d\u8def\u5e94\u8be5\u90fd\u660e\u767d\u7684\uff0c\u5148\u628a\u6574\u4e2a\u5b57\u7b26\u4e32\u5012\u8f6c\u4e00\u904d\uff0c\u7136\u540e\u6309\u7167\u5355\u8bcd\u518d\u5012\u8f6c\u56de\u6765\uff0c\u62ff”the sky is blue”\u4e3a\u4f8b\uff1a<\/p>\n
    \n
  1. “eulb si yks eht<\/span>“<\/li>\n
  2. “blue<\/span> si yks eht”<\/li>\n
  3. “blue is<\/span> yks eht”<\/li>\n
  4. …<\/li>\n
  5. “blue is sky the”<\/li>\n<\/ol>\n
    \u4ee3\u7801<\/h3>\n
    class Solution {\npublic:\n\tvoid reverseWordsSub(string &s, int start, int end) {\n\t\t\/\/[start,end]\n\t\tchar c;\n\t\tint count = 0;\n\t\tconst int maxInd = (end - start - 1) \/ 2 + start;\n\t\tfor (int i = start; i <= maxInd; i++) {\n\t\t\tc = s[i];\n\t\t\ts[i] = s[end - count];\n\t\t\ts[end - count] = c;\n\t\t\tcount++;\n\t\t}\n\t}\n\tvoid clearStr(string &s) {\n\t\t\/\/Clear unnecessary spaces\n\t\tint validIndex = -1;\n\t\tbool spaceFlag = false;\n\t\tfor (int i = 0; i<s.size(); i++) {\n\t\t\tif (s[i] != ' ') {\n\t\t\t\ts[++validIndex] = s[i];\n\t\t\t\tspaceFlag = false;\n\t\t\t}\n\t\t\telse if (!spaceFlag) {\n\t\t\t\tif (validIndex < 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tspaceFlag = true;\n\t\t\t\ts[++validIndex] = s[i];\n\t\t\t}\n\t\t}\n\t\tif (spaceFlag)\n\t\t\tvalidIndex--;\n\t\tif (validIndex < 0)\n\t\t\ts = \"\";\n\t\telse\n\t\t\ts = s.substr(0, validIndex + 1);\n\t}\n\tvoid reverseWords(string &s) {\n\t\tclearStr(s);\n\t\tint strSz = s.size();\n\t\treverseWordsSub(s, 0, strSz - 1);\n\t\tint start = 0;\n\t\tfor (int i = 0; i<strSz; i++) {\n\t\t\tif (s[i] == ' ') {\n\t\t\t\treverseWordsSub(s, start, i - 1);\n\t\t\t\tstart = i + 1;\n\t\t\t}\n\t\t}\n\t\treverseWordsSub(s, start, strSz - 1);\n\t}\n};<\/pre>\n
     <\/p>\n","protected":false},"excerpt":{"rendered":"
    \u9898\u76ee Given an input string, reverse the string word by word. For example, Given s = “the sky is blue“, return “blue is sky the“. Update (2015-02-12): For C programmers: Try to solve it in-place in O(1) space. \u601d\u8def \u4e00\uff01\u5b9a\uff01\u8981\uff01\u8003\uff01\u8651\uff01\u5404\uff01\u79cd\uff01\u60c5\uff01\u51b5\uff01\u6bd4\u5982 ” “\/\/\u4e00\u4e2a\u7a7a\u683c ” What am I doing ” \u7136\u540e\u8fd9\u79cd\u5012\u8f6c\u95ee\u9898\u7684\u539f\u5730\u5904\u7406\u601d\u8def\u5e94\u8be5\u90fd\u660e\u767d\u7684\uff0c\u5148\u628a\u6574\u4e2a\u5b57\u7b26\u4e32\u5012\u8f6c\u4e00\u904d\uff0c\u7136\u540e\u6309\u7167\u5355\u8bcd\u518d\u5012\u8f6c\u56de\u6765\uff0c\u62ff”the sky is blue”\u4e3a\u4f8b\uff1a “eulb si yks […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[66,151],"class_list":["post-2004","post","type-post","status-publish","format-standard","hentry","category-study","tag-leetcode-oj","tag-151"],"_links":{"self":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2004","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2004"}],"version-history":[{"count":0,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2004\/revisions"}],"wp:attachment":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2004"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2004"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2004"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}