Re: [閒聊] 每日leetcode

看板Marginalman作者JerryChungYC (JerryChung)時間1年前 (2024/09/10 09:18)推噓3(3推 0噓 2→)

留言5則, 5人參與討論串833/1548 (看更多)

https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list 2807. Insert Greateset Common Divisors in Linked List 給一個 linked list 每一個節點都包含一個整數值在每對相鄰節點之間插入一個新節點值為兩數的最大公約數返回插入後的 linked list greatest common divisor 是能整除兩個數的最大正整數 Example 1: Input: head = [18,6,10,3] Output: [18,6,6,2,10,1,3] Explanation: gcd(18,6)=6, gcd(6,10)=2, gcd(10,3)=1 https://assets.leetcode.com/uploads/2023/07/18/ex1_copy.png

Example 2: Input: head = [7] Output: [7] Explanation: 沒有相鄰節點直接返回原本的 head https://assets.leetcode.com/uploads/2023/07/18/ex2_copy1.png

Constraints: 節點數 [1, 5000] 節點值 1 <= Node.val <= 1000 思路：照著做就好 Python Code: # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next from math import gcd class Solution: def insertGreatestCommonDivisors(self, head: Optional[ListNode]) -> Optional[ListNode]: curr = head while curr and curr.next: next_node = curr.next curr.next = ListNode(gcd(curr.val, next_node.val), next_node) curr = next_code return head 怎麼又是 Linked List 不過現在對 Linked List 比較懂一些了還可以 -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 60.251.52.67 (臺灣) ※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1725931135.A.C19.html

→

JerryChungYC

09/10 09:20, 1年前 , 1^F

09/10 09:20, 1^F

※ 編輯: JerryChungYC (60.251.52.67 臺灣), 09/10/2024 09:24:58

推

sustainer123

09/10 09:20, 1年前 , 2^F

09/10 09:20, 2^F

推

JIWP

09/10 09:25, 1年前 , 3^F