Just a Prime factorization Problem


  • 0
    X

    In fact, this is a very easy problem with Prime factorization.

    What ever the number n is, the minimum number of steps is sums of all the prime factor of number n.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.