Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 3110 with 26 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 3110 # by problem number
lcpy gen -s score_of_a_string # by problem name
s. The score of a string is defined as the sum of the absolute difference between the ASCII values of adjacent characters.
Return the score of s.
Input: s = "hello"
Output: 13
Explanation: The ASCII values of the characters in `s` are: `'h' = 104`, `'e' = 101`, `'l' = 108`, `'o' = 111`. So, the score of `s` would be `|104 - 101| + |101 - 108| + |108 - 108| + |108 - 111| = 3 + 7 + 0 + 3 = 13`.
Input: s = "zaz"
Output: 50
Explanation: The ASCII values of the characters in `s` are: `'z' = 122`, `'a' = 97`. So, the score of `s` would be `|122 - 97| + |97 - 122| = 25 + 25 = 50`.
s consists only of lowercase English letters.class Solution:
# Time: O(n)
# Space: O(1)
def score_of_string(self, s: str) -> int:
return sum(abs(ord(s[i]) - ord(s[i + 1])) for i in range(len(s) - 1))
| Time | Space |
|---|---|
| O(n) | O(1) |