Skip to content

Commit

Permalink
New Problem Solution - "1859. Sorting the Sentence"
Browse files Browse the repository at this point in the history
  • Loading branch information
haoel committed May 22, 2021
1 parent 88f9a14 commit f0dd110
Show file tree
Hide file tree
Showing 2 changed files with 66 additions and 0 deletions.
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,7 @@ LeetCode

| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|1859|[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/) | [C++](./algorithms/cpp/sortingTheSentence/SortingTheSentence.cpp)|Easy|
|1857|[Largest Color Value in a Directed Graph](https://leetcode.com/problems/largest-color-value-in-a-directed-graph/) | [C++](./algorithms/cpp/largestColorValueInADirectedGraph/LargestColorValueInADirectedGraph.cpp)|Hard|
|1856|[Maximum Subarray Min-Product](https://leetcode.com/problems/maximum-subarray-min-product/) | [C++](./algorithms/cpp/maximumSubarrayMinProduct/MaximumSubarrayMinProduct.cpp)|Medium|
|1855|[Maximum Distance Between a Pair of Values](https://leetcode.com/problems/maximum-distance-between-a-pair-of-values/) | [C++](./algorithms/cpp/maximumDistanceBetweenAPairOfValues/MaximumDistanceBetweenAPairOfValues.cpp)|Medium|
Expand Down
65 changes: 65 additions & 0 deletions algorithms/cpp/sortingTheSentence/SortingTheSentence.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,65 @@
// Source : https://leetcode.com/problems/sorting-the-sentence/
// Author : Hao Chen
// Date : 2021-05-22

/*****************************************************************************************************
*
* A sentence is a list of words that are separated by a single space with no leading or trailing
* spaces. Each word consists of lowercase and uppercase English letters.
*
* A sentence can be shuffled by appending the 1-indexed word position to each word then rearranging
* the words in the sentence.
*
* For example, the sentence "This is a sentence" can be shuffled as "sentence4 a3 is2 This1"
* or "is2 sentence4 This1 a3".
*
* Given a shuffled sentence s containing no more than 9 words, reconstruct and return the original
* sentence.
*
* Example 1:
*
* Input: s = "is2 sentence4 This1 a3"
* Output: "This is a sentence"
* Explanation: Sort the words in s to their original positions "This1 is2 a3 sentence4", then remove
* the numbers.
*
* Example 2:
*
* Input: s = "Myself2 Me1 I4 and3"
* Output: "Me Myself and I"
* Explanation: Sort the words in s to their original positions "Me1 Myself2 and3 I4", then remove the
* numbers.
*
* Constraints:
*
* 2 <= s.length <= 200
* s consists of lowercase and uppercase English letters, spaces, and digits from 1 to 9.
* The number of words in s is between 1 and 9.
* The words in s are separated by a single space.
* s contains no leading or trailing spaces.
******************************************************************************************************/

class Solution {
public:
string sortSentence(string s) {
const int MAX_WORDS = 9;
string ss[MAX_WORDS];
string word;
for(int i=0; i<s.size(); i++){
char ch = s[i];

if (ch >='0' && ch <='9'){
ss[ch-'0'-1] = word;
word = "";
}else if (ch != ' ') {
word += ch;
}
}

for(int i=1; i < MAX_WORDS; i++){
if (ss[i].size() <= 0 ) continue;
ss[0] = ss[0] +" " + ss[i];
}
return ss[0];
}
};

0 comments on commit f0dd110

Please sign in to comment.