{"id":9344,"date":"2021-12-31T14:41:17","date_gmt":"2021-12-31T22:41:17","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=9344"},"modified":"2021-12-31T14:52:43","modified_gmt":"2021-12-31T22:52:43","slug":"leetcode-1974-minimum-time-to-type-word-using-special-typewriter","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/math\/leetcode-1974-minimum-time-to-type-word-using-special-typewriter\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1974. Minimum Time to Type Word Using Special Typewriter"},"content":{"rendered":"\n

There is a special typewriter with lowercase English letters 'a'<\/code> to 'z'<\/code> arranged in a circle<\/strong> with a pointer<\/strong>. A character can only<\/strong> be typed if the pointer is pointing to that character. The pointer is initially<\/strong> pointing to the character 'a'<\/code>.<\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n

Each second, you may perform one of the following operations:<\/p>\n\n\n\n

  • Move the pointer one character counterclockwise<\/strong> or clockwise<\/strong>.<\/li>
  • Type the character the pointer is currently<\/strong> on.<\/li><\/ul>\n\n\n\n

    Given a string word<\/code>, return the minimum<\/strong> number of seconds to type out the characters in word<\/code>.<\/p>\n\n\n\n

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

    Input:<\/strong> word = \"abc\"\nOutput:<\/strong> 5\nExplanation: \n<\/strong>The characters are printed as follows:\n- Type the character 'a' in 1 second since the pointer is initially on 'a'.\n- Move the pointer clockwise to 'b' in 1 second.\n- Type the character 'b' in 1 second.\n- Move the pointer clockwise to 'c' in 1 second.\n- Type the character 'c' in 1 second.\n<\/pre>\n\n\n\n
    Example 2:<\/strong><\/p>\n\n\n\n
    Input:<\/strong> word = \"bza\"\nOutput:<\/strong> 7\nExplanation:\n<\/strong>The characters are printed as follows:\n- Move the pointer clockwise to 'b' in 1 second.\n- Type the character 'b' in 1 second.\n- Move the pointer counterclockwise to 'z' in 2 seconds.\n- Type the character 'z' in 1 second.\n- Move the pointer clockwise to 'a' in 1 second.\n- Type the character 'a' in 1 second.\n<\/pre>\n\n\n\n
    Example 3:<\/strong><\/p>\n\n\n\n
    Input:<\/strong> word = \"zjpc\"\nOutput:<\/strong> 34\nExplanation:<\/strong>\nThe characters are printed as follows:\n- Move the pointer counterclockwise to 'z' in 1 second.\n- Type the character 'z' in 1 second.\n- Move the pointer clockwise to 'j' in 10 seconds.\n- Type the character 'j' in 1 second.\n- Move the pointer clockwise to 'p' in 6 seconds.\n- Type the character 'p' in 1 second.\n- Move the pointer counterclockwise to 'c' in 13 seconds.\n- Type the character 'c' in 1 second.\n<\/pre>\n\n\n\n
    Constraints:<\/strong><\/p>\n\n\n\n
    • 1 <= word.length <= 100<\/code><\/li>
    • word<\/code> consists of lowercase English letters.<\/li><\/ul>\n\n\n\n
      Solution: Clockwise or Counter-clockwise?<\/strong><\/h2>\n\n\n\n
      For each pair of (prev, curr), choose the shortest distance.
      One is abs(p – c), another is 26 – abs(p – c).
      Don’t forget to add 1 for typing itself.<\/p>\n\n\n\n
      Time complexity: O(n)
      Space complexity: O(1)<\/p>\n\n\n\n
      \n
      C++<\/h2>\n
      \n\n
      \/\/ Author: Huahua\nclass Solution {\npublic:\n  int minTimeToType(string word) {\n    int ans = 0;\n    char p = 'a';\n    for (char c : word) {\n      ans += 1 + min(abs(c - p), 26 - abs(c - p));\n      p = c;\n    }\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
      There is a special typewriter with lowercase English letters ‘a’ to ‘z’ arranged in a circle with a pointer. A character can only be typed if the pointer is pointing to that character. The…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[49],"tags":[575,222,31],"class_list":["post-9344","post","type-post","status-publish","format-standard","hentry","category-math","tag-circle","tag-easy","tag-math","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9344","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=9344"}],"version-history":[{"count":3,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9344\/revisions"}],"predecessor-version":[{"id":9348,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9344\/revisions\/9348"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9344"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9344"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9344"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}