LeetCode - ReverseString
2017-03-09 13:26
72 查看
题目原址:https://leetcode.com/problems/reverse-string/?tab=Description
Write a function that takes a string as input and returns the string reversed.
Example:
Given s = “hello”, return “olleh”.
解题思路:这是一道关于字符串和反序的问题,现在提供两种解决方法。
法1. 新建一个字符串S2,反序取出原字符串S1中的字符放入S2中。这样的好处是我们保留了原字符串,但是会占用两倍的内存。在Leetcode中会报错为内存不够。
法2. 将原字符串的首尾对调。
下面分别给出两种解的代码片段:
Write a function that takes a string as input and returns the string reversed.
Example:
Given s = “hello”, return “olleh”.
解题思路:这是一道关于字符串和反序的问题,现在提供两种解决方法。
法1. 新建一个字符串S2,反序取出原字符串S1中的字符放入S2中。这样的好处是我们保留了原字符串,但是会占用两倍的内存。在Leetcode中会报错为内存不够。
法2. 将原字符串的首尾对调。
下面分别给出两种解的代码片段:
//Solution1: class Solution { public: string reverseString(string s) { int slength = s.size(); string newstring; for(int i = 0; i < slength; i++) { newstring = newstring+s[slength - i-1]; } return newstring; } };
//Solution2: class Solution { public: string reverseString(string s) { int slength = s.size(); char temp; for (int i = 0; i < slength/2; i++) { temp = s[i]; s[i] = s[slength - i - 1]; s[slength - i - 1] = temp; } return s; } };
相关文章推荐
- 22-reverseString-Leetcode
- LeetCode-Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode]Maximal Rectangle
- [LeetCode-23] Convert Sorted Array to Binary Search Tree
- LeetCode 88. Merge Sorted Array
- LeetCode-Maximal Rectangle[code]
- 【LeetCode】5. Longest Palindromic Substring
- [LeetCode] MaximumDepth of Binary Tree
- Largest Rectangle in Histogram -- leetcode
- Binary Tree Level Order Traversal II --leetcode C++
- LeetCode Implement Queue using Stacks
- LeetCode(49)Group Anagrams
- leetcode 110 Balanced Binary Tree
- [leetcode] 319. Bulb Switcher
- LeetCode || 198. House Robber
- LeetCode *** 290. Word Pattern
- leetcode-101
- Leetcode-insertion-sort-list ***
- [LeetCode136]Single Number
- leetcode_223. Rectangle Area 求两个矩形覆盖的面积之和