-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day6_ScoreOfAString.txt
57 lines (33 loc) · 1.14 KB
/
Day6_ScoreOfAString.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// You are given a string 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.
// Example 1:
// 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.
// Example 2:
// 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.
// Constraints:
// 2 <= s.length <= 100
// s consists only of lowercase English letters.
// Topics
// String
// Solution:
class Solution {
public:
int scoreOfString(string s) {
int n=s.size();
int ans=0;
for(int i=0;i<n- 1;i++){
int first=(int)s[i];
int second=(int)s[i+ 1];
// if(first>=second){ans+=first- second;}
// else{ans+=second- first;}
ans+=abs(first- second);
}
return ans;
}
};