<6>——ZigZag Conversion

本文介绍了一种称为ZigZag的字符串转换方法,该方法根据指定的锯齿层数重新排列输入字符串。文章详细解释了转换过程,并提供了两种实现这一转换的C++代码示例。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

六、ZigZag Conversion

锯齿变换

题目大意:输入一个字符串和int型(锯齿层数)

将字符串以锯齿变化重新排序

例:

“HAIZEIKEJILAOCHUANZHANG",numRows=5

通过如下形式转换:



ret="HJAAEIUNIKLHZGZIACHNEOA";

解析:

周期:z=n+(n-2);

顶层:每周期第一个元素

中间层:

j行左偏差:ld=j;

j行右偏差:rd=z-j;

底层:每周期最后一个元素


我的代码:

class Solution {
public:
    string convert(string s, int numRows) {
        int N=s.length();
        if(N<=numRows||numRows<=1)return s;
        int z=numRows+numRows-2;//周期长度
        string ret="";
        for(int i=0;i<N;i+=z)//锯齿顶层
            ret+=s[i];
        for(int j=1;j<numRows-1;j++)//中间层
            for(int t=0;t<N;t+=z)
            {
                if(t+j<N)ret+=s[t+j];//左偏差为j
                if(t+z-j<N)ret+=s[t+z-j];//右偏差为i
            }
        for(int i=numRows-1;i<N;i+=z)//锯齿底层
            ret+=s[i];
        return ret;
    }
};
经典代码:
class Solution {
public:
    string convert(string s, int numRows) {
        string result="";
        if(numRows==1)
			return s;
        int step1,step2;
        int len=s.size();
        for(int i=0;i<numRows;++i){
            step1=(numRows-i-1)*2;
            step2=(i)*2;
            int pos=i;
            if(pos<len)
                result+=s.at(pos);
            while(1){
                pos+=step1;
                if(pos>=len)
                    break;
				if(step1)
					result+=s.at(pos);
                pos+=step2;
                if(pos>=len)
                    break;
				if(step2)
					result+=s.at(pos);
            }
        }
        return result;
    }
};



zhu@zhu:~/桌面/zhu/gym-duckietown$ python3 manual_control.py --env-name Duckietown Traceback (most recent call last): File "manual_control.py", line 16, in <module> from gym_duckietown.envs import DuckietownEnv File "/home/zhu/桌面/zhu/gym-duckietown/gym_duckietown/envs/__init__.py", line 4, in <module> from gym_duckietown.envs.duckietown_env import DuckietownEnv File "/home/zhu/桌面/zhu/gym-duckietown/gym_duckietown/envs/duckietown_env.py", line 5, in <module> from ..simulator import Simulator File "/home/zhu/桌面/zhu/gym-duckietown/gym_duckietown/simulator.py", line 8, in <module> import geometry File "/home/zhu/.local/lib/python3.8/site-packages/geometry/__init__.py", line 48, in <module> from .basic_utils import * File "/home/zhu/.local/lib/python3.8/site-packages/geometry/basic_utils.py", line 4, in <module> from contracts import contract, new_contract File "/home/zhu/.local/lib/python3.8/site-packages/contracts/__init__.py", line 44, in <module> from .useful_contracts import * File "/home/zhu/.local/lib/python3.8/site-packages/contracts/useful_contracts/__init__.py", line 8, in <module> from .numpy_specific import * File "/home/zhu/.local/lib/python3.8/site-packages/contracts/useful_contracts/numpy_specific.py", line 8, in <module> def finite(x): File "/home/zhu/.local/lib/python3.8/site-packages/contracts/__init__.py", line 28, in new_contract return new_contract_main(*args) File "/home/zhu/.local/lib/python3.8/site-packages/contracts/main.py", line 553, in new_contract new_contract_impl(identifier, function) File "/home/zhu/.local/lib/python3.8/site-packages/contracts/main.py", line 563, in new_contract_impl from .syntax import ParseException File "/home/zhu/.local/lib/python3.8/site-packages/contracts/syntax.py", line 91, in <module> from .library import (EqualTo, Unary, Binary, composite_contract, File "/home/zhu/.local/lib/python3.8/site-packages/contracts/library/__init__.py", line 29, in <module> from .array import (ShapeContract, Shape, Array, ArrayConstraint, DType, File "/home/zhu/.local/lib/python3.8/site-packages/contracts/library/array.py", line 6, in <module> from .array_ops import (ArrayOR, ArrayAnd, DType, ArrayConstraint, File "/home/zhu/.local/lib/python3.8/site-packages/contracts/library/array_ops.py", line 231 np_int': np.int_, # Platform integer (normally either int32 or int64) ^ SyntaxError: EOL while scanning string literal
最新发布
07-10
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值