# 反转字符串重的单词

## 反转字符串重的单词

题目链接: <https://leetcode.cn/problems/reverse-words-in-a-string>

## 解题思路

1. 从字符串s末尾开始遍历，遇到非空格就追加到tmp前面，遇到空格就将tmp拼接到res后面

```go
func reverseWords(s string) string {
	res,tmp := "",""
	for i := len(s) - 1; i >= 0; i-- {
		if s[i] != ' ' {
			tmp = string(s[i]) + tmp
		} else if tmp != "" {
			res = getStr(res, tmp)
			tmp = ""
		}
	}
	if tmp != "" {
		res = getStr(res, tmp)
	}
	return res
}

func getStr(res, tmp string) string {
	if len(res) != 0 {
		res += " "
	}
	return res + tmp
}

```

### 复杂度分析

* **时间复杂度:** $$O(n)$$
* **空间复杂度:** $$O(n)$$


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://leetcodebook-1.gitbook.io/top-interview-150/array-string/reverse-words-in-a-string.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.