算法1
(暴力枚举) $O(n^2)$
就循环遍历,模拟
时间复杂度
参考文献
C++ 代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ListNode* insertGreatestCommonDivisors(ListNode* head) {
if (!head || !head->next) {
return head;
}
ListNode* dummy = new ListNode(0);
dummy->next = head;
ListNode* prev = dummy;
while (prev->next && prev->next->next) {
ListNode* node1 = prev->next;
ListNode* node2 = prev->next->next;
int gcd_val = gcd(node1->val, node2->val);
ListNode* new_node = new ListNode(gcd_val);
new_node->next = node2;
node1->next = new_node;
prev = prev->next->next;
}
ListNode* new_head = dummy->next;
delete dummy;
return new_head;
}
};