Given a string in compressed form, decompress it to the original string. The adjacent repeated characters in the original string are compressed to have the character followed by the number of repeated occurrences. Assumptions The string is not null T…

Given a string, replace adjacent, repeated characters with the character followed by the number of repeated occurrences. Assumptions The string is not null The characters used in the original string are guaranteed to be ‘a’ - ‘z’ Examples “abbcccdeee…

原题地址: 344 Reverse String: https://leetcode.com/problems/reverse-string/description/ 541 Reverse String II: https://leetcode.com/problems/reverse-string-ii/description/ 题目&&解法: 1.Reverse String: Write a function that takes a string as input and ret…

344. Reverse String 最基础的旋转字符串 class Solution { public: void reverseString(vector<char>& s) { if(s.empty()) return; ; ; while(start < end){ char tmp = s[end]; s[end] = s[start]; s[start] = tmp; start++; end--; } return; } }; 541. Reverse Strin…

Reverse Words in a String I Given an input string, reverse the string word by word. For example,Given s = "the sky is blue",return "blue is sky the". Have you met this question in a real interview? Yes Clarification What constitutes a…

package leadcode; /** * 541. Reverse String II * Easy * 199 * 575 * * * 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 lef…

541. 反转字符串 II 541. Reverse String II…

problem 541. Reverse String II 题意: 给定一个字符串,每隔k个字符翻转这k个字符,剩余的小于k个则全部翻转,否则还是只翻转剩余的前k个字符. solution1: class Solution { public: string reverseStr(string s, int k) { int n = s.size(); int cnt = n / k; ; i<=cnt; i++) { ==) { if(i*k+k<n) reverse(s.begin()+i…

You are given a string with lower case letters only. Compress it by putting the count of the letter after it. If the letter appears once, Example: compress function: input = aaaabbc output = a4b2c decompress function: input = a2bc3 output = aabccc pu…

题目: Given an input string, reverse the string word by word. A word is defined as a sequence of non-space characters. The input string does not contain leading or trailing spaces and the words are always separated by a single space. For example,Given…