Question

我试图做一个模型级, 找出两个数字的基点共同分区。如果我把68和22的答案是2, 答案是正确的, 但如果我把678 352的答案是678 352, 结果是326和错误的! 应该2! 任何想法吗?

def gcd 
  if firstnumber > secondnumber
    div= firstnumber/ secondnumber
    ip=firstnumber % secondnumber
    fi = div / ip
    ip
  else 
    i = firstnumber 
    s = secondnumber 
    secondnumber = firstnumber 
    firstnumber = s 
    div= firstnumber/ secondnumber 
    ip=firstnumber % secondnumber 
    fi = div / ip ip 
  end 
end

环环环环

def gcd
   a = firstnumber
   b=secondnumber
   ip = 50
   if firstnumber > secondnumber
     begin   
       fi=a/b
       re=a%b    
       fi=b/re
       re=re%b
       ip=re        
     end until ip != 0
     return re  
   end
   else
     i = firstnumber
     s = secondnumber
     secondnumber = firstnumber
     firstnumber = s
     div= firstnumber/ secondnumber
     ip=firstnumber % secondnumber
     fi = div / ip
     ip
   end
end

美元美元美元美元美元美元美元美元美元美元美元美元美元美元美元美元美元美元

同样的事情发生

Answer 1

Ruby有一个有方法 Integer 的类 > 。不要重新发明方向盘。这里读到 < a href="http://www.ruby-doc.org/core-1.9.3/Integer.html#method-i-gcd" rel="nofol" > http://www.ruby-doc.org/core-1.9.3/Integer.html#method-i-gcd



irb(main):001:0> 68.gcd(22)
=> 2
irb(main):002:0> 678.gcd(352)
=> 2


该方法的来源是:

   def gcd(n)
     m = self.abs
     n = n.abs

     return n if m == 0
     return m if n == 0

     b = 0
     while n[0] == 0 && m[0] == 0
       b += 1; n >>= 1; m >>= 1
     end
     m >>= 1 while m[0] == 0
     n >>= 1 while n[0] == 0
     while m != n
       m, n = n, m if n > m
       m -= n; m >>= 1 while m[0] == 0
     end
     m << b
   end

友情链接