There is a special keyboard with all keys in a single row.
Given a string
keyboard of length 26 indicating the layout of the keyboard (indexed from 0 to 25), initially your finger is at index 0. To type a character, you have to move your finger to the index of the desired character. The time taken to move your finger from index
i to index
|i - j|.
You want to type a string
word. Write a function to calculate how much time it takes to type it with one finger.
Input: keyboard = "abcdefghijklmnopqrstuvwxyz", word = "cba" Output: 4 Explanation: The index moves from 0 to 2 to write 'c' then to 1 to write 'b' then to 0 again to write 'a'. Total time = 2 + 1 + 1 = 4.
Input: keyboard = "pqrstuvwxyzabcdefghijklmno", word = "leetcode" Output: 73
keyboard.length == 26
keyboardcontains each English lowercase letter exactly once in some order.
1 <= word.length <= 10^4
word[i]is an English lowercase letter.
Subtract previous index and add time.
class Solution: def calculateTime(self, keyboard: str, word: str) -> int: time = 0 prev_index = 0 for w in word: time += abs(keyboard.index(w) - prev_index) prev_index = keyboard.index(w) return time
- Time Complexity: O(N)
- Space Complexity: O(1)