Leetcode47: Palindrome Linked List

Given a singly linked list, determine if it is a palindrome.

推断一个链表是不是回文的，一个比較简单的办法是把链表每一个结点的值存在vector里。然后首尾比較。时间复杂度O(n)。空间复杂度O(n)。

/*** Definition for singly-linked list.* struct ListNode {*     int val;*     ListNode *next;*     ListNode(int x) : val(x), next(NULL) {}* };*/
class Solution {
public:bool isPalindrome(ListNode* head) {vector<int> temp;ListNode* ptr = head;while(ptr!=NULL){temp.push_back(ptr->val);ptr = ptr->next;}int n = temp.size();for(int i = 0; i < n/2; i++){if(temp[i] != temp[n-1-i])return false;}return true;}
};

Leetcode47: Palindrome Linked List相关推荐

[LeetCode][JavaScript]Palindrome Linked List
Palindrome Linked List Given a singly linked list, determine if it is a palindrome. Follow up: Could ...
【回文串7】LeetCode 234. Palindrome Linked List
LeetCode 234. Palindrome Linked List Solution1:我的答案一遍过,哈哈哈! /*** Definition for singly-linked list. ...
234. Palindrome Linked List - Easy
Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false ...
234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time ...
[LeetCode] Palindrome Linked List
Given a singly linked list, determine if it is a palindrome. 一开始想用栈,但是试来试去发现写不出来遂放弃,后来想想再不济可以转换成数组然后 ...
LeetCode 234. Palindrome Linked List
题目: Given a singly linked list, determine if it is a palindrome. 思路: 给定一个链表,判断它是不是回文链表根据链表的奇偶分情况,然后 ...
C#LeetCode刷题之#234-回文链表（Palindrome Linked List）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3905 访问. 请判断一个链表是否为回文链表. 输入: 1-> ...
[LeetCode] 234. Palindrome Linked List_Easy tag: Linked List
Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false ...
[LeetCode] 234. Palindrome Linked List 回文链表
Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false ...

Leetcode47: Palindrome Linked List

Leetcode47: Palindrome Linked List相关推荐

最新文章

热门文章