def numSquares(self, n):
        while len(Solution.F) <= n:
            i = len(Solution.F)
            Solution.F.append(sys.maxint)
            j = 1
            while i - j*j >= 0:
                Solution.F[i] = min(Solution.F[i], Solution.F[i-j*j]+1)
                j += 1

        return Solution.F[n]
Recursively compares nodes within the XML tree.
dataset/ETHPy150Open algorhythms/LeetCode/279 Perfect Squares.py/Solution.numSquares--crossover with--dataset/ETHPy150Open openstack/ec2-api/ec2api/tests/unit/matchers.py/XMLMatches._compare_node