algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

删除多余空格和无用空格

Browse Source 
Remove fault and redundant bracket
This commit is contained in:
Huairuo Yang
2021-06-09 20:08:36 -04:00
committed by GitHub
parent e470235464
commit c06f5d2cce
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0151.翻转字符串里的单词.md
View File

@ -183,7 +183,7 @@ public:
int end = 0; // 反转的单词在字符串里终止位置 int end = 0; // 反转的单词在字符串里终止位置
bool entry = false; // 标记枚举字符串的过程中是否已经进入了单词区间 bool entry = false; // 标记枚举字符串的过程中是否已经进入了单词区间
for (int i = 0; i < s.size(); i++) { // 开始反转单词 for (int i = 0; i < s.size(); i++) { // 开始反转单词
if ((!entry))) { if (!entry) {
start = i; // 确定单词起始位置 start = i; // 确定单词起始位置
entry = true; // 进入单词区间 entry = true; // 进入单词区间
} }