LeetCode 369. Plus One Linked List--链表--C++,Python解法

最新推荐文章于 2023-01-05 00:00:32 发布

zhangpeterx

最新推荐文章于 2023-01-05 00:00:32 发布

阅读量401

点赞数

分类专栏： LeetCode c++-做题 python-做题

本文链接：https://blog.csdn.net/zhangpeterx/article/details/101446735

版权

LeetCode 同时被 3 个专栏收录

122 篇文章 6 订阅

订阅专栏

python-做题

100 篇文章 3 订阅

订阅专栏

c++-做题

44 篇文章 2 订阅

订阅专栏

该博客介绍了LeetCode 369题目的解决方案，即如何对一个由非负整数表示的非空单链表进行加1操作。内容包括Python和C++两种解法，强调了时间复杂度为O(n)，空间复杂度为O(1)。

摘要由CSDN通过智能技术生成

题目地址：Plus One Linked List - LeetCode

Given a non-negative integer represented as non-empty a singly linked list of digits, plus one to the integer.

You may assume the integer do not contain any leading zero, except the number 0 itself.

The digits are stored such that the most significant digit is at the head of the list.

Example :

Input: [1,2,3]
Output: [1,2,4]

这道题目的意思也很简单，就是链表加1.

Python解法如下：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None


class Solution:
    def plusOne(self, head: ListNode) -> ListNode:
        l = []
        while head != None:
            l.append(head)
            head = head.next
        i = len(l)-1
        while i >= 0:
            l[i].val += 1
            if l[i].val >= 10:
                l[i].val -= 10
                i -= 1
            else:
                break
        if i == -1:
            root = ListNode(x=1)
            root.next = l[0]
            return root
        else:
            return l[0]

时间复杂度为O(n)，空间复杂度为O(1)。

C++解法如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *plusOne(ListNode *head) {
        if (head == nullptr) {
            return nullptr;
        }
        vector<ListNode *> l;
        while (head != nullptr) {
            l.push_back(head);
            head = head->next;
        }
        int i = l.size() - 1;
        while (i >= 0) {
            l[i]->val++;
            if (l[i]->val >= 10) {
                l[i]->val -= 10;
                i--;
            } else {
                break;
            }
        }
        if (i == -1) {
            ListNode *root = new ListNode(1);
            root->next = l[0];
            return root;
        } else {
            return l[0];
        }
    }
};