[521. Longest Uncommon Subsequence I] C++_AC

  • 0

    So does this problem matters in the interview....?

    class Solution {
    int findLUSlength(string a, string b) {
        int n = max(a.size(), b.size());
        if(a == b || n == 0){return -1;}
        return n;

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.