forked from dnshi/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathReverseString_II.js
More file actions
56 lines (54 loc) · 1.3 KB
/
ReverseString_II.js
File metadata and controls
56 lines (54 loc) · 1.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
// Source : https://leetcode.com/problems/reverse-string-ii
// Author : Dean Shi
// Date : 2017-03-11
/***************************************************************************************
*
* 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]
*
*
*
* Subscribe to see which companies asked this question.
*
*
*
*
*
* Show Tags
*
*
* String
*
*
*
*
*
*
*
* Show Similar Problems
*
*
***************************************************************************************/
/**
* @param {string} s
* @param {number} k
* @return {string}
*/
var reverseStr = function(s, k) {
return s.length <= k
? s.split('').reverse().join('')
: reverseStr(s.substring(0, k), k) + s.substring(k, 2 * k) + reverseStr(s.substring(2 * k), k)
};