557. Reverse Words in a String III\521. Longest Uncommon Subsequence I

557. Reverse Words in a String III

DESCRIPTION

Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.

Example 1:
Input: "Let's take LeetCode contest"
Output: "s'teL ekat edoCteeL tsetnoc"

Note: In the string, each word is separated by single space and there will not be any extra space in the string.

IMPLEMENTATION

class Solution {
public:
    string reverseWords(string s) {
        string res, tmp;
        int len = s.length();
        for(int idx = 0; idx < len; ++idx) {
            if(s[idx] == ' ')  {
                if(tmp.size()) {
                tmp += ' ';
                res += tmp;
                tmp.clear();
                }
            }    
            else tmp = s[idx] + tmp;
        }
        if(tmp.size()) res += tmp;     
        return res;
    }
};

521. Longest Uncommon Subsequence I

DESCRIPTION

Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be any subsequence of the other strings.

A subsequence is a sequence that can be derived from one sequence by deleting some characters without changing the order of the remaining elements. Trivially, any string is a subsequence of itself and an empty string is a subsequence of any string.

The input will be two strings, and the output needs to be the length of the longest uncommon subsequence. If the longest uncommon subsequence doesn’t exist, return -1.

Example 1:
Input: "aba", "cdc"
Output: 3
Explanation: The longest uncommon subsequence is "aba" (or "cdc"), 
because "aba" is a subsequence of "aba", 
but not a subsequence of any other strings in the group of two strings. 

Note:

• Both strings’ lengths will not exceed 100.
• Only letters from a ~ z will appear in input strings.

From this problem, I find the longer string will be unique to the other string. And if two strings are held the same length, then if these two are definite the same, then return -1, otherwise is the length of string.

IMPLEMENTATION

The code show below:

class Solution {
public:
    int findLUSlength(string a, string b) {
        int len_a = a.size();
        int len_b = b.size();
        int res = len_a;
        cout << len_a << " " << len_b << endl;
        if(len_a != len_b) return max(len_a, len_b);
        for(int idx = 0; idx < len_a; ++idx) {
            if(a[idx] == b[idx]) res--;
        }
        return res?len_a:-1;
    }
};