leetcode_344_ Reverse String(C++)(easy)
2016-04-27 14:59
489 查看
Write a function that takes a string as input and returns the string reversed.
Example:
Given s = "hello", return "olleh".
思路:字符串可以类似数组一样通过下标方式访问,如s[1] = 'e' 因此可以很容易将字符串逆置。
class Solution {
public:
string reverseString(string s) {
int len = s.size();
if(len == 0 || len == 1)
return s;
else
{
for(int i = 0; i < len / 2; ++ i )
{
char temp = s[i];
s[i] = s[len - i - 1];
s[len - i - 1] = temp;
}
return s;
}
}
};
Example:
Given s = "hello", return "olleh".
思路:字符串可以类似数组一样通过下标方式访问,如s[1] = 'e' 因此可以很容易将字符串逆置。
class Solution {
public:
string reverseString(string s) {
int len = s.size();
if(len == 0 || len == 1)
return s;
else
{
for(int i = 0; i < len / 2; ++ i )
{
char temp = s[i];
s[i] = s[len - i - 1];
s[len - i - 1] = temp;
}
return s;
}
}
};
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解