Given two ints, each in the range 10..99, return true if there is a digit that appears in both numbers, such as the 2 in 12 and 23. (Note: division, e.g. n/10, gives the left digit while the % "mod" n%10 gives the right digit.)

shareDigit(12, 23) → true
shareDigit(12, 43) → false
shareDigit(12, 44) → false

1
2
3
4
5
6
7
public boolean shareDigit(int a, int b) {
  int a1=a/10;
  int a2=a%10;
  int b1=b/10;
  int b2=b%10;
  return (a1==b1 || a1==b2 || b1==a2 || a2==b2);
}

Keresés

Ajánló