{"id":8595,"date":"2021-10-04T19:54:10","date_gmt":"2021-10-05T02:54:10","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8595"},"modified":"2021-10-04T20:14:05","modified_gmt":"2021-10-05T03:14:05","slug":"leetcode-2027-minimum-moves-to-convert-string","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/string\/leetcode-2027-minimum-moves-to-convert-string\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2027. Minimum Moves to Convert String"},"content":{"rendered":"\n

You are given a string s<\/code> consisting of n<\/code> characters which are either 'X'<\/code> or 'O'<\/code>.<\/p>\n\n\n\n

A move<\/strong> is defined as selecting three<\/strong> consecutive characters<\/strong> of s<\/code> and converting them to 'O'<\/code>. Note that if a move is applied to the character 'O'<\/code>, it will stay the same<\/strong>.<\/p>\n\n\n\n

Return the minimum<\/strong> number of moves required so that all the characters of <\/em>s<\/code> are converted to <\/em>'O'<\/code>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> s = \"XXX\"\nOutput:<\/strong> 1\nExplanation:<\/strong> XXX -> OOO\nWe select all the 3 characters and convert them in one move.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> s = \"XXOX\"\nOutput:<\/strong> 2\nExplanation:<\/strong> XXOX -> OOOX -> OOOO\nWe select the first 3 characters in the first move, and convert them to 'O'<\/code>.\nThen we select the last 3 characters and convert them so that the final string contains all 'O'<\/code>s.<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> s = \"OOOO\"\nOutput:<\/strong> 0\nExplanation:<\/strong> There are no 'X's<\/code> in s<\/code> to convert.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 3 <= s.length <= 1000<\/code><\/li>
  • s[i]<\/code> is either 'X'<\/code> or 'O'<\/code>.<\/li><\/ul>\n\n\n\n
    Solution: Straight Forward<\/strong><\/h2>\n\n\n\n
    if s[i] == ‘X’, change s[i], s[i + 1] and s[i + 2] to ‘O’.<\/p>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \nclass Solution {\npublic:\n  int minimumMoves(string s) {\n    const int n = s.length();\n    int ans = 0;\n    for (size_t i = 0; i < n; ++i) {\n      if (s[i] == 'X') {\n        ans += 1;\n        i += 2;\n      }\n    }\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    You are given a string s consisting of n characters which are either ‘X’ or ‘O’. A move is defined as selecting three consecutive characters of s and converting them to ‘O’. Note that if a move is applied to…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[184,47],"tags":[222,722,4],"class_list":["post-8595","post","type-post","status-publish","format-standard","hentry","category-array","category-string","tag-easy","tag-moves","tag-string","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8595","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8595"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8595\/revisions"}],"predecessor-version":[{"id":8597,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8595\/revisions\/8597"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8595"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8595"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8595"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}