LRU变形+reverse+pq存Map.Entry<String,Integer>

class Solution {
    public void reverse(String s, int k) {
        if (s == null || s.length() <2) {
            return;
        }

        int len = s.length();
        int count = len / k;
        int i = 0;
        StringBuilder sb = new StringBuilder();
        while (i             if (i % 2 == 0) {
                StringBuilder temp = new StringBuilder();
                temp.append(s.substring(i * k, i * k + k));

                sb.append(temp.reverse());
            } else {
                sb.append(s.substring(i * k, i * k + k));
            }
            i++;
        }
        if (len % k == 0) {
            System.out.println(sb.toString());
            return ;
        }
        if (count % 2 == 1) {
            sb.append(s.substring(count * k, s.length()));
            System.out.println(sb.toString());
            return ;
        } else {
            StringBuilder temp = new StringBuilder();
            temp.append(s.substring(count * k, s.length()));
            sb.append(temp.reverse());
            System.out.println(sb.toString());
            return ;
        }

    }


    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Solution sol = new Solution();
        String s = "abcdefg";
        sol.reverse(s, 2);
    }
}