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

题目地址：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 = Noneclass Solution:def plusOne(self, head: ListNode) -> ListNode:l = []while head != None:l.append(head)head = head.nexti = len(l)-1while i >= 0:l[i].val += 1if l[i].val >= 10:l[i].val -= 10i -= 1else:breakif i == -1:root = ListNode(x=1)root.next = l[0]return rootelse: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];}}
};

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

LeetCode Notes_#206 Reverse Linked List（C++,Python）
LeetCode Notes_#206 Reverse Linked List(C++,Python) LeetCode Linked List Contents 题目思路思考解答 C++ P ...
LeetCode 148. Sort List--面试算法题--C++,Python解法
LeetCode 148. Sort List–面试算法题–C++,Python解法 LeetCode题解专栏:LeetCode题解 LeetCode 所有题目总结:LeetCode 所有题目总结大 ...
LeetCode 226. Invert Binary Tree--反转二叉树--C++,Python解法--递归，迭代做法
题目地址:Invert Binary Tree - LeetCode Invert a binary tree. Example: Input: 4/ \2 7/ \ / \ 1 3 6 9 Outp ...
LeetCode 230. Kth Smallest Element in a BST--C++,Python解法--面试真题--找二叉树中第K小的元素
题目地址:Kth Smallest Element in a BST - LeetCode Given a binary search tree, write a function kthSmalle ...
LeetCode 152. Maximum Product Subarray--动态规划--C++,Python解法
题目地址:Maximum Product Subarray - LeetCode Given an integer array nums, find the contiguous subarray w ...
LeetCode 93. Restore IP Addresses--面试算法题--Python解法
题目地址:Restore IP Addresses - LeetCode Given a string containing only digits, restore it by returning ...
LeetCode 316. Remove Duplicate Letters--贪心--Java,C++,Python解法
题目地址:Number of Longest Increasing Subsequence - LeetCode 做这道题目前建议先做:Longest Increasing Subsequence - ...
LeetCode - 题 70 跳台阶 - 具体思路与python解法
LeetCode 题目假设你正在爬楼梯.需要 n 阶你才能到达楼顶.每次你可以爬 1 或 2 个台阶.你有多少种不同的方法可以爬到楼顶呢? 注意:给定 n 是一个正整数. 剑指offer 题目青蛙 ...
LeetCode 3. Longest Substring Without Repeating Characters-- c++,java,python解法
题目地址: Given a string, find the length of the longest substring without repeating characters. Example ...

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

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

最新文章

热门文章