Rearrange Spaces Between Words — LeetCode 1592 Python Solution
- Problem
- #1592
- Pattern
- Hash Map
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given a string text of words that are placed among some number of spaces. Each word consists of one or more lowercase English letters and are separated by at least one space.
Example
- Input
- text = " this is a sentence "
- Output
- "this is a sentence"
- Explanation
- There are a total of 9 spaces and 4 words. We can evenly divide the 9 spaces between the words: 9 / (4-1) = 3 spaces.
Python solution
class Solution:
def reorderSpaces(self, text: str) -> str:
spaces = text.count(" ")
words = text.split()
if len(words) == 1:
return words[0] + " " * spaces
cnt, mod = divmod(spaces, len(words) - 1)
return (" " * cnt).join(words) + " " * modComplexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(n), where n represents the length of the string \textit{text} auxiliary |
Pattern: Hash Map
Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1592. Rearrange Spaces Between Words is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.
The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 1592. Rearrange Spaces Between Words?
- LeetCode 1592. Rearrange Spaces Between Words is rated Easy on LeetCode.
- What is the time complexity of LeetCode 1592. Rearrange Spaces Between Words?
- The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 1592. Rearrange Spaces Between Words?
- The Python solution on this page uses O(n), where n represents the length of the string \textit{text} auxiliary space.
- What topics does LeetCode 1592. Rearrange Spaces Between Words cover?
- LeetCode 1592. Rearrange Spaces Between Words is tagged String on LeetCode.