물음표 살인마의 개발블로그

알고리즘 문제/CodeWar

Are they the "same"?

BEstyle 2022. 9. 20. 12:34

DESCRIPTION:

Given two arrays a and b write a function comp(a, b) (orcompSame(a, b)) that checks whether the two arrays have the "same" elements, with the same multiplicities (the multiplicity of a member is the number of times it appears). "Same" means, here, that the elements in b are the elements in a squared, regardless of the order.

Examples

Valid arrays
a = [121, 144, 19, 161, 19, 144, 19, 11]  
b = [121, 14641, 20736, 361, 25921, 361, 20736, 361]

comp(a, b) returns true because in b 121 is the square of 11, 14641 is the square of 121, 20736 the square of 144, 361 the square of 19, 25921 the square of 161, and so on. It gets obvious if we write b's elements in terms of squares:

a = [121, 144, 19, 161, 19, 144, 19, 11] 
b = [11*11, 121*121, 144*144, 19*19, 161*161, 19*19, 144*144, 19*19]
Invalid arrays

If, for example, we change the first number to something else, comp is not returning true anymore:

a = [121, 144, 19, 161, 19, 144, 19, 11]  
b = [132, 14641, 20736, 361, 25921, 361, 20736, 361]

comp(a,b) returns false because in b 132 is not the square of any number of a.

a = [121, 144, 19, 161, 19, 144, 19, 11]  
b = [121, 14641, 20736, 36100, 25921, 361, 20736, 361]

comp(a,b) returns false because in b 36100 is not the square of any number of a.

Remarks

  • a or b might be [] or {} (all languages except R, Shell).
  • a or b might be nil or null or None or nothing (except in C++, COBOL, Crystal, D, Dart, Elixir, Fortran, F#, Haskell, Nim, OCaml, Pascal, Perl, PowerShell, Prolog, PureScript, R, Racket, Rust, Shell, Swift).

If a or b are nil (or null or None, depending on the language), the problem doesn't make sense so return false.


def comp(array1, array2):
    print(array1)
    print(array2)
    if array1==[] and array2==[]:
        return True
    if array1==[]:
        return False
    if array2==[]:
        return False
    leng=len(array1)
    for i in range(leng):
        squared=array1[0]**2
        if squared in array2:
            array2.remove(squared)
            array1.remove(array1[0])
        else:
            return False
    return True

'알고리즘 문제 > CodeWar' 카테고리의 다른 글

Sum of odd numbers  (0) 2022.09.20
Duplicate Encoder  (0) 2022.09.20
Isograms  (1) 2022.09.19
Reverse Words  (1) 2022.09.19
Array.diff  (0) 2022.09.19