clueless coding // TODO: be smarter

LeetCode Longest Uncommon Subsequence I: CPP Solution



TL;DR Code Solution


int findLUSlength(string a, string b) {
    if (a == b) {
        return -1;
    }
    else {
        return max(a.length(), b.length());
    }
}