比较字符串的子序列：求解《521. 最长特殊序列 Ⅰ》和《522. 最长特殊序列 II》

var findLUSlength = function(a, b) {
  return a === b ? -1 : Math.max(a.length, b.length)
};

function findLUSlength(a: string, b: string): number {
  return a === b ? -1 : Math.max(a.length, b.length)
};

func findLUSlength(a string, b string) int {
  if a == b {
    return -1
  }
  return int(math.Max(float64(len(a)), float64(len(b))))
}

class Solution {
  function findLUSlength($a, $b) {
    return $a === $b ? -1 : max(strlen($a), strlen($b));
  }
}

class Solution:
  def findLUSlength(self, a: str, b: str) -> int:
    return -1 if a == b else max(len(a), len(b))

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

public class Solution {
  public int FindLUSlength(string a, string b) {
    return a == b ? -1 : Math.Max(a.Length, b.Length);
  }
}

MAX(a, b) a > b ? a : b
int findLUSlength(char * a, char * b){
  return strcmp(a, b) == 0 ? -1 : MAX(strlen(a), strlen(b));
}

class Solution {
public:
  int findLUSlength(string a, string b) {
    return a == b ? -1 : max(a.size(), b.size());
  }
};

var findLUSlength = function(strs) {
  const n = strs.length
  let r = -1
  label: for (let i = 0; i < n; i++) {
    for (let j = 0; j < n; j++) {
      if (i !== j && isSequence(strs[i], strs[j])) {
        continue label;
      }
    }
    r = Math.max(r, strs[i].length)
  }
  return r
};
const isSequence = (s1, s2) => {
  const n1 = s1.length, n2 = s2.length
  if (n1 > n2) return false
  let p1 = p2 = 0
  while (p1 < n1 && p2 < n2) {
    if (s1[p1] === s2[p2]) p1++
    p2++  
  }
  return p1 === n1
}

function findLUSlength(strs: string[]): number {
  const n = strs.length
  let r = -1
  label: for (let i = 0; i < n; i++) {
    for (let j = 0; j < n; j++) {
      if (i !== j && isSequence(strs[i], strs[j])) {
        continue label
      }
    }
    r = Math.max(r, strs[i].length)
  }
  return r
};
function isSequence(s1: string, s2: string) {
  const n1 = s1.length, n2 = s2.length
  if (n1 > n2) return false
  let p1 = 0, p2 = 0
  while (p1 < n1 && p2 < n2) {
    if (s1[p1] === s2[p2]) p1++
    p2++
  }
  return p1 === n1
}

func findLUSlength(strs []string) int {
  r := -1
  for i, s1 := range strs {
    for j, s2 := range strs {
      if i != j && isSequence(s1, s2) {
        goto label
      }
    }
    r = int(math.Max(float64(r), float64(len(s1))))
    label:
  }
  return r
}
func isSequence(s1 string, s2 string) bool {
  n1, n2 := len(s1), len(s2)
  if n1 > n2 {
    return false
  }
  p1, p2 := 0, 0
  for p1 < n1 && p2 < n2 {
    if s1[p1] == s2[p2] {
      p1++
    }
    p2++
  }
  return p1 == n1
}

class Solution {
  function findLUSlength($strs) {
    $n = count($strs);
    $r = -1;
    for ($i = 0; $i < $n; $i++) {
      for ($j = 0; $j < $n; $j++) {
        if ($i !== $j && $this->isSequence($strs[$i], $strs[$j])) {
          continue 2;
        }
      }
      $r = max($r, strlen($strs[$i]));
    }
    return $r;
  }
  function isSequence($s1, $s2) {
    $n1 = strlen($s1);
    $n2 = strlen($s2);
    if ($n1 > $n2) return false;
    $p1 = $p2 = 0;
    while ($p1 < $n1 && $p2 < $n2) {
      if ($s1[$p1] === $s2[$p2]) $p1++;
      $p2++;
    }
    return $p1 === $n1;
  }
}

class Solution:
  def isSequence(self, s1: str, s2: str) -> bool:
    n1, n2 = len(s1), len(s2)
    if n1 > n2: return False
    p1, p2 = 0, 0
    while p1 < n1 and p2 < n2:
      if s1[p1] == s2[p2]: p1 += 1
      p2 += 1
    return p1 == n1
  def findLUSlength(self, strs: List[str]) -> int:
    r = -1
    for i, s1 in enumerate(strs):
      for j, s2 in enumerate(strs):
        if i != j and self.isSequence(s1, s2):
          break
      else:
        r = max(r, len(s1))
    return r

class Solution {
  public int findLUSlength(String[] strs) {
    int n = strs.length, r = -1;
    label: for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (i != j && isSequence(strs[i], strs[j])) continue label;
      }
      r = Math.max(r, strs[i].length());
    }
    return r;
  }
  public boolean isSequence(String s1, String s2) {
    int n1 = s1.length(), n2 = s2.length();
    if (n1 > n2) return false;
    int p1 = 0, p2 = 0;
    while (p1 < n1 && p2 < n2) {
      if (s1.charAt(p1) == s2.charAt(p2)) p1++;
      p2++;
    }
    return p1 == n1;
  }
}

public class Solution {
  public int FindLUSlength(string[] strs) {
    int n = strs.Length, r = -1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (i != j && isSequence(strs[i], strs[j])) {
          goto label;
        }
      }
      r = Math.Max(r, strs[i].Length);
      label:;
    }
    return r;
  }
  public bool isSequence(string s1, string s2) {
    int n1 = s1.Length, n2 = s2.Length;
    if (n1 > n2) return false;
    int p1 = 0, p2 = 0;
    while (p1 < n1 && p2 < n2) {
      if (s1[p1] == s2[p2]) p1++;
      p2++;
    }
    return p1 == n1;
  }
}

MAX(a, b) a > b ? a : b
bool isSequence(char* s1, char* s2) {
  int n1 = strlen(s1), n2 = strlen(s2);
  if (n1 > n2) return false;
  int p1 = 0, p2 = 0;
  while (p1 < n1 && p2 < n2) {
    if (s1[p1] == s2[p2]) p1++;
    p2++;
  }
  return p1 == n1;
}
int findLUSlength(char ** strs, int strsSize){
  int r = -1;
  for (int i = 0; i < strsSize; i++) {
    for (int j = 0; j < strsSize; j++) {
      if (i != j && isSequence(strs[i], strs[j])) goto label;
    }
    r = MAX(r, (int)strlen(strs[i]));
    label:;
  }
  return r;
}

class Solution {
public:
  bool isSequence(string s1, string s2) {
    int n1 = s1.size(), n2 = s2.size();
    if (n1 > n2) return false;
    int p1 = 0, p2 = 0;
    while (p1 < n1 && p2 < n2) {
      if (s1[p1] == s2[p2]) p1++;
      p2++;
    }
    return p1 == n1;
  }
  int findLUSlength(vector<string>& strs) {
    int n = strs.size(), r = -1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (i != j && isSequence(strs[i], strs[j])) {
          goto label;
        }
      }
      r = max(r, (int)strs[i].size());
      label:;
    }
    return r;
  }
};