039 to re-submit week1 homework with correct naming standard

plin005 · web-flow · commit 7be601475fdb · 2019-04-28T22:32:48.000+08:00
diff --git a/Week_01/id_39/LeetCode_083_039.java b/Week_01/id_39/LeetCode_083_039.java
@@ -0,0 +1,28 @@
+package com.paula.algorithmsAndDataStructure.leetCode_83;
+
+public class LeetCode_083_039 {
+	public ListNode deleteDuplicates(ListNode head) {
+		if(head == null) return null;
+		
+		ListNode p = head;
+		ListNode q = null;
+        while(p.next != null) {
+        	if(p.val == p.next.val) {
+        		if(q == null || (q != null && q.val != p.val)) {
+        			q = p;
+        		}
+        	}else {
+        		if(q != null && q.val == p.val) {
+        			q.next = p.next;
+        		}
+        	}
+        	p = p.next;
+        }
+        
+        if(q != null && p.val == q.val && p.next == null) {
+        	q.next = null;
+        } 
+		return head;
+    }
+
+}
diff --git a/Week_01/id_39/LeetCode_922_039.java b/Week_01/id_39/LeetCode_922_039.java
@@ -0,0 +1,42 @@
+package com.paula.algorithmsAndDataStructure;
+
+public class LeetCode_922_039 {
+	public int[] sortArrayByParityII(int[] A) {
+        int len = A.length;
+    	int i=0; //偶数下标
+    	int j=i+1; //奇数下标
+    	Boolean evenIndexOddValue = false;
+    	Boolean oddIndexEvenValue = false;
+    	
+        while (i < len-1 && j < len) {
+        	evenIndexOddValue = isOdd(A[i]);
+            oddIndexEvenValue= isEven(A[j]);
+
+        	if(!evenIndexOddValue) i +=2;
+        	if(!oddIndexEvenValue) j +=2;
+        	if(evenIndexOddValue && oddIndexEvenValue) {
+        		int tempVal = A[i];
+        		A[i] = A[j];
+        		A[j] = tempVal;
+        		
+        		i += 2;
+        		j += 2;
+        		
+        	}
+        }
+        
+     
+    	return A;
+    }
+    
+    public  boolean isEven(int value) {
+    	
+    	return value%2 == 0 ? true : false;
+    }
+    
+    public  boolean isOdd(int value) {
+    	
+    	return value%2 == 1 ? true : false;
+    }
+
+}
