G5

Author: sanyathisside

LeetCode/Palindrome linked list.cpp

@@ -0,0 +1,29 @@
+/**
+ * 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:
+    bool isPalindrome(ListNode* head) {
+        ListNode* temp=head;
+        vector<int> v;
+        while(temp){
+            v.push_back(temp->val);
+            temp=temp->next;
+        }
+        int i=0, j=v.size()-1;
+        while(i<j){
+            if(v[i]==v[j]){
+                i++;
+                j--;
+            }else return false;
+        }
+        return true;
+    }
+};