class Solution { public: /** * * @param s string字符串 s.size() <= 1e5 * @param k int整型 k <= s.size() * @return int整型 */ int turn(string s, int k) { // write code here int cnt = 0, n = s.size(); for (int i = 0; i < k; i++) { for (int j = i; j < n-k; j += k) { for (int l = i; l < n-k-j; l += k) { if (s[l] < s[l+k]) { cnt++; } } } } return cnt; } };
class Solution { public: /** * * @param s string字符串 s.size() <= 1e5 * @param k int整型 k <= s.size() * @return int整型 */ int turn(string s, int k) { // write code here int cnt = 0, n = s.size(); for (int i = 0; i < k; i++) { int num[26] = {0}; for (int j = i; j < n; j += k) { int index = s[j]-'a'; num[index]++; for (int l = 0; l < index; l++) { if (num[l] > 0) cnt += num[l]; } } } return cnt; } };