zoukankan      html  css  js  c++  java
  • LeetCode 541. Reverse String II

    question:

    Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.
    
    Example:
    
    Input: s = "abcdefg", k = 2
    Output: "bacdfeg"
    
    Restrictions:
    
        The string consists of lower English letters only.
        Length of the given string and k will in the range [1, 10000]

    try:

    class Solution {
        public String reverseStr(String s, int k) {
            char[] charArray=s.toCharArray();
            int length=charArray.length;
            char[] result=new char[length];
            
            for(int i=0;i<length;i++){
                if((i/k)%2==0){
                    if(length<((i/k)*k+k)){
                        result[length-1-i%k]=charArray[i];
                        //continue;
                    }else{
                        result[(i/k)*k+k-1-i%k]=charArray[i];     
                    }

                    
                }else {
                    result[i]=charArray[i];
                }
                    
            }
            return new String(result);
        }
    }

     result: 22.58%

    conclusion:

  • 相关阅读:
    手机号码正则表达式
    POJ 3233 Matrix Power Series 矩阵快速幂
    UVA 11468
    UVA 1449
    HDU 2896 病毒侵袭 AC自动机
    HDU 3065 病毒侵袭持续中 AC自动机
    HDU 2222 Keywords Search AC自动机
    POJ 3461 Oulipo KMP模板题
    POJ 1226 Substrings KMP
    UVA 1455 Kingdom 线段树+并查集
  • 原文地址:https://www.cnblogs.com/hzg1981/p/8971683.html
Copyright © 2011-2022 走看看