同步代码

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/LinkedList.java

@@ -185,16 +185,21 @@ public void removeFirstSize(int firstSize) {
      * @param length
      */
     public void remove(int i, int length) {
-        if (i == 0 ) {removeFirstSize(length); return;}
-        if (i >= size || length == 0) {return;}
+        if (i == 0) {
+            removeFirstSize(length);
+            return;
+        }
+        if (i >= size || length == 0) {
+            return;
+        }
 
         int lastLenth = size - i;
-        length = length <= lastLenth? length : lastLenth;
-        Node pre = node(i-1);
+        length = length <= lastLenth ? length : lastLenth;
+        Node pre = node(i - 1);
         int j = 0;
 
         Node next = pre;
-        while (j++ < length){
+        while (j++ < length) {
             next = next.next;
         }
         pre.next = next.next;
@@ -213,9 +218,44 @@ public void remove(int i, int length) {
      * @param list
      */
     public int[] getElements(LinkedList list) {
-        return null;
+        if (size() == 0) {
+            return new int[0];
+        }
+        Iterator iterator = list.iterator();
+        Node fromNode = iterator().nextNode();
+        int fromIndex = 0;
+
+        int[] retArray = new int[list.size()];
+        int retIndex = 0;
+        while (iterator.hasNext()) {
+            int index = (int) iterator.next();
+            Node node = node(fromNode, fromIndex, index);
+            fromIndex = index;
+            fromNode = node;
+            if (node == null) {
+                return retArray;
+            } else {
+                retArray[retIndex++] = (int)node.data;
+            }
+        }
+        return retArray;
     }
 
+    private Node node(Node fromNode, int fromIndex, int index) {
+        Node next = fromNode;
+        int nextIndex = fromIndex;
+        while (next != null && nextIndex < index) {
+            next = next.next;
+            nextIndex++;
+        }
+        if (nextIndex == index) {
+            return next;
+        } else {
+            return null;
+        }
+    }
+
+
     /**
      * 已知链表中的元素以值递增有序排列，并以单链表作存储结构。
      * 从当前链表中中删除在listB中出现的元素

group17/1204187480/code/homework/basic/src/test/java/com/coding/basic/LinkedListTest.java

@@ -3,6 +3,8 @@
 import org.junit.Assert;
 import org.junit.Test;
 
+import java.util.Arrays;
+
 /**
  * Created by luoziyihao on 3/23/17.
  */
@@ -83,9 +85,12 @@ private LinkedList createAndFillLinkedList() {
     }
 
     private LinkedList createAndFillLinkedList(int length) {
+        return createAndFillLinkedList(1, length);
+    }
 
+    private LinkedList createAndFillLinkedList(int start, int length) {
         LinkedList linkedList = new LinkedList();
-        for (int i = 1; i <= length; i++) {
+        for (int i = start; i <= length; i++) {
             linkedList.add(i);
         }
         return linkedList;
@@ -136,6 +141,9 @@ public void remove7() throws Exception {
 
     @Test
     public void getElements() throws Exception {
+        LinkedList listA= createAndFillLinkedList(0,8);
+        LinkedList listB = createAndFillLinkedList(4, 4);
+        Assert.assertEquals("[4,5,6,7]", Arrays.toString(listA.getElements(listB)));
 
     }
 

group17/1204187480/code/homework/parent/pom.xml

@@ -92,4 +92,13 @@
         </plugins>
     </build>
 
+    <reporting>
+        <plugins>
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-surefire-report-plugin</artifactId>
+                <version>2.19.1</version>
+            </plugin>
+        </plugins>
+    </reporting>
 </project>

group17/1264835468/.gitignore

@@ -1,5 +1,7 @@
-/bin/
+/bin/
 
 .classpath
 .project
-.gitignore
+.gitignore
+/.idea/
+.iml