reverse linked list

Author: eunhwa99

leetcode-study

@@ -0,0 +1 @@
+Subproject commit 047a415438a8373121413e6a52fd11bdca53efbf

leetcode-study-1

@@ -0,0 +1 @@
+Subproject commit 58e2901afafa568cb0f15d5e002c23444e22cf31

reverse-linked-list/eunhwa99.java

@@ -0,0 +1,29 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+
+ // 시간 복잡도: O(N)
+ // 공간복잡도: O(N)
+class Solution {
+    public ListNode reverseList(ListNode head) {
+        if(head==null) return head;
+
+        ListNode pointer = new ListNode(head.val);
+        
+        ListNode tempPointer;
+        while(head.next!=null){
+            tempPointer = new ListNode(head.next.val, pointer);
+            pointer = tempPointer;
+            head = head.next;
+        }
+    }
+    return pointer;
+}
+

top-k-frequent-elements/leetcode-study

@@ -0,0 +1 @@
+Subproject commit 32ed2baa8e51b39625f99ea72a780c6edca6e9ee