→ nh60211as: std::gcd 09/10 21:26
推 sustainer123: if y==0 return x else return gcd(y,x%y) 09/10 21:27
→ sustainer123: 遞迴長這樣 迴圈我忘了 09/10 21:28
我好像第一次用gcd這個function
不過要我寫我也不知道怎麼寫
輾轉相除法好難
def insertGreatestCommonDivisors(self, head: Optional[ListNode]) ->
Optional[ListNode]:
headdd = head
while head:
pre = head
head = head.next
if head:
pre.next = ListNode(math.gcd(pre.val, head.val))
pre.next.next = head
return headdd
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 125.229.37.69 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1725974733.A.BDE.html