首页 > itarticle > algorithm notes: leetcode#521 longest uncommon subsequence i

algorithm notes: leetcode#521 longest uncommon subsequence i

admin 11月 12, 2020 0

Problem

Solution

Python implementation

class :
    def findLUSlength(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: int
        """
        if a == b:
            return -1
        return max(len(a), len(b))

Java implementation

class  {
    public int findLUSlength(String a, String b) {
        if(a.equals(b)){ return -1; }
        return a.length() > b.length() ? a.length() : b.length();
    }
}

Time complexity

O(N).

Space complexity

O(1).

Links

521. Longest Uncommon Subsequence I
(中文版) 算法笔记: 力扣#521 最长特殊序列 Ⅰ