[LeetCode] 541.Reverse String II
来源:互联网 发布:linux 存放.rpm的目录 编辑:程序博客网 时间:2024/06/03 09:01
[LeetCode] 541.Reverse String II
- 题目描述
- 解题思路
- 实验代码
题目描述
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:
1. The string consists of lower English letters only.
2. Length of the given string and k will in the range [1, 10000]
解题思路
和上次的字符串反转一样,这道题我还是用到了reverse()函数,而难点在于理解题目意思,需要做一个判断,由于2*k的不确定性,想清楚就能很容易解决。
实验代码
class Solution {public: string reverseStr(string s, int k) { int l = s.length(); for (int i = 0; i < l; i += 2*k) reverse(s.begin()+i, min(s.begin()+i+k, s.end())); return s; }};
阅读全文
0 0
- leetcode 541. Reverse String II
- Leetcode-541. Reverse String II
- 【Leetcode】541. Reverse String II
- 541. Reverse String II LeetCode
- [LeetCode]541. Reverse String II
- LeetCode 541. Reverse String II
- LeetCode 541. Reverse String II
- leetcode-541. Reverse String II
- [leetcode]541. Reverse String II
- [leetcode]: 541. Reverse String II
- LeetCode:541. Reverse String II
- LeetCode 541. Reverse String II
- leetcode 541. Reverse String II
- leetcode#541. Reverse String II
- leetcode 541. Reverse String II
- LeetCode-541. Reverse String II
- [LeetCode] 541. Reverse String II
- LeetCode 541. Reverse String II
- [kuangbin带你飞]专题七 线段树 B
- [LeetCode] 520.Detect Capital
- Date日期类的实现(C++)
- opencv学习笔记一
- 9.24linux系统文件
- [LeetCode] 541.Reverse String II
- Integer和int基本类型的比较
- [LeetCode] 566.Reshape the Matrix
- 基于FreeRTOS与MQTT的物联网技术应用系列——步进电机控制(五)MQTT的移植和步进电机控制的实现
- Ubuntu软件源
- 关系数据库
- JAVA JDK动态代理图解
- MYSQL游标
- [LeetCode] 415.Add Strings