力扣-每日一题 重新排列单词间的空格

题目链接：力扣https://leetcode.cn/problems/rearrange-spaces-between-words/我的解题过程：

1.统计单词和空格的数量并用vector容器存储所有单词

2.计算间隔空格和多余的空格，重新拼接字符串

注意点：

1.注意越界问题

2.注意只有一个单词的情况（我计算时用单词数-1 导致一个单词情况下出现 /0 的报错情况）

我的题解代码：

#include<iostream>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#include<queue>
#include<unordered_set>
using namespace std;

class Solution {
public:
    string reorderSpaces(string text) {
        vector<string>Word;
        int Length_str = text.length();
        int Num_word = 0;
        int Num_blank = 0;
        for (int i = 0; i < Length_str; i++)
        {
            if (text[i] == ' ')
            {
                Num_blank++;
            }
            else
            {
                Num_word++;
                string word = "";
                while (text[i] != ' ')
                {
                    word += text[i];
                    i++;
                    if (i >= Length_str)
                    {
                        break;
                    }
                }
                i--;
                Word.push_back(word);
                //cout << word << endl;
            }
        }
        //cout << Num_blank << endl;
        //cout << Num_word << endl;

        int Num_blank_space;
        int Num_blank_superfluous;
        if (Num_word == 1)
        {
            Num_blank_space = Num_blank;
            Num_blank_superfluous = Num_blank;
        }
        else
        {
            Num_blank_space = Num_blank / (Num_word - 1);
            Num_blank_superfluous = Num_blank % (Num_word - 1);
        }

        string Target_text = "";
        int Num_Word = Word.size();
        for (int i = 0; i < Num_Word; i++)
        {
            Target_text += Word[i];
            if (i == Num_Word - 1)
            {
                for (int j = 0; j < Num_blank_superfluous; j++)
                {
                    Target_text += ' ';
                }
            }
            else
            {
                for (int j = 0; j < Num_blank_space; j++)
                {
                    Target_text += ' ';
                }
            }
        }
        return Target_text;
    }
};

int main()
{
    string str = "  this   is  a sentence ";
    Solution sc;
    string strx = sc.reorderSpaces(str);
    cout << strx << endl;
    return 0;
}