HW 1 Submission

Buwen Pan/HW1 PlaceHolder/Merged Two Sorted Lists

@@ -0,0 +1,29 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
+        ListNode newHead = new ListNode(0);
+        ListNode cur = newHead;
+
+        while(l1 != null && l2 != null){
+            if(l1.val >= l2.val){
+                cur.next = l2;
+                l2 = l2.next;
+            }else{
+                cur.next = l1;
+                l1 = l1.next;
+            }
+            cur = cur.next;
+        }
+        if(l1 != null){ cur.next = l1; }
+        if(l2 != null){ cur.next = l2; }
+
+        return newHead.next;
+    }
+}

Buwen Pan/HW1 PlaceHolder/Remove duplicates from sorted list II.txt

@@ -0,0 +1,31 @@
+//Remove duplicates from sorted list II
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if(head==null || head.next==null){ return head; }
+
+        ListNode newHead = new ListNode(0);
+        newHead.next = head;
+        int N; //duplicate num is stored in N
+
+        ListNode cur = newHead;
+        while(cur.next != null && cur.next.next != null){
+            if(cur.next.val == cur.next.next.val){
+                N = cur.next.val;
+                while(cur.next != null && N == cur.next.val){
+                    cur.next = cur.next.next;
+                }
+            }else{
+                cur = cur.next;
+            }
+        }
+        return newHead.next;
+    }
+}

Buwen Pan/HW1 PlaceHolder/Reverse Linked List II

@@ -0,0 +1,35 @@
+Reverse Linked List II
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    public ListNode reverseBetween(ListNode head, int m, int n) {
+        for(int i = 0; i < n - m; i++){
+            //defined positions used for finding right nodes
+            int position1 = m + i;
+            int position2 = n - i;
+            if(position1 >= position2){ return head; }
+
+            ListNode cur1 = head;
+            ListNode cur2 = head;
+            while(position1 - 1 > 0){
+                cur1 = cur1.next;
+                position1--;
+            }
+            while(position2 - 1 > 0){
+                cur2 = cur2.next;
+                position2--;
+            }
+
+            int temp = cur1.val;
+            cur1.val = cur2.val;
+            cur2.val = temp;
+        }
+        return head;
+    }
+}

Buwen Pan/fang/sss.txt

@@ -0,0 +1 @@
+win shi sb!