From e228009c98f0459f159996908cf157ec9eefaa03 Mon Sep 17 00:00:00 2001 From: kai Date: Mon, 13 Mar 2017 09:07:36 +0800 Subject: [PATCH] =?UTF-8?q?=E7=AC=AC=E4=B8=89=E6=AC=A1=E4=BD=9C=E4=B8=9A?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- group06/1378560653/article.txt | 3 + .../src/com/coderising/array/ArrayUtil.java | 4 + .../src/com/coding/basic/LinkedList.java | 386 +++++++++++++----- 3 files changed, 289 insertions(+), 104 deletions(-) create mode 100644 group06/1378560653/article.txt diff --git a/group06/1378560653/article.txt b/group06/1378560653/article.txt new file mode 100644 index 0000000000..478dde01b7 --- /dev/null +++ b/group06/1378560653/article.txt @@ -0,0 +1,3 @@ +��һƪ���£�http://blog.csdn.net/raymond120/article/details/57415472 +�ڶ�ƪ���£�http://blog.csdn.net/raymond120/article/details/58043040 +����ƪ���£�http://blog.csdn.net/raymond120/article/details/60759278 \ No newline at end of file diff --git a/group06/1378560653/src/com/coderising/array/ArrayUtil.java b/group06/1378560653/src/com/coderising/array/ArrayUtil.java index 11fefff510..2542d4336d 100644 --- a/group06/1378560653/src/com/coderising/array/ArrayUtil.java +++ b/group06/1378560653/src/com/coderising/array/ArrayUtil.java @@ -10,6 +10,10 @@ public class ArrayUtil { * @return */ public void reverseArray(int[] origin){ + //一定要判断边界条件 + if(origin == null || origin.length == 0){ + return; + } int N = origin.length; for(int i = 0; i < N/2; i++){ int temp = origin[i]; diff --git a/group06/1378560653/src/com/coding/basic/LinkedList.java b/group06/1378560653/src/com/coding/basic/LinkedList.java index 3c82bb9da2..d7b4775f35 100644 --- a/group06/1378560653/src/com/coding/basic/LinkedList.java +++ b/group06/1378560653/src/com/coding/basic/LinkedList.java @@ -1,164 +1,342 @@ package com.coding.basic; + + public class LinkedList implements List { private Node head; - private int size = 0; + private int size; - public void add(Object o){ - if(null == head){ - head = new Node(o); - head.next = null; - }else{ - Node pt = head; - while(head.next != null){ - pt = pt.next; - } - pt.next = new Node(o); - pt.next.next =null; + private static class Node { + Object data; + Node next; + + public Node(Object data){ + this.data = data; + this.next = null; } - size++; } + public LinkedList(){ + this.head = new Node(null); + this.size = 0; + } + + public void add(Object o){ + Node newNode = new Node(o); + Node pNode = head; + while(pNode.next != null){ + pNode = pNode.next; + } + + pNode.next = newNode; + size++; + } public void add(int index , Object o){ - if(index < size){ - Node pt = head; - for(int i = 0; i < index-1; i++){ - pt = pt.next; - } - Node pt1 = pt.next.next; - pt.next = new Node(o); - pt.next.next = pt1; - size ++; + checkIndex(index); + + Node newNode = new Node(o); + Node node = new Node(null); + Node pNode = head; + for(int i = 0; i < index; i++){ + node = pNode; + pNode = pNode.next; } + + node.next = newNode; + newNode.next = pNode; + size++; } public Object get(int index){ - if(index < size){ - Node pt = head; - for(int i = 0; i < index; i++){ - pt = pt.next; - } - return pt.data; - }else{ - return null; + checkIndex(index); + + Node pNode = head; + for(int i = 0; i < index; i++){ + pNode = pNode.next; } + + return pNode.data; } public Object remove(int index){ - if(index < size){ - Node pt = head; - for(int i = 0; i< index -1;i++){ - pt = pt.next; - } - Node pt1 = pt.next; - pt.next = pt1.next; - return pt1.data; - }else{ + checkIndex(index); + if(size == 0){ return null; } + + Node node = new Node(null); + Node pNode = head; + for(int i = 0; i < index; i++){ + node = pNode; + pNode = pNode.next; + } + node.next = pNode.next; + size--; + + return pNode; } public int size(){ - if(null == head){ - size = 0; - }else{ - Node pt = head; - while(pt.next != null){ - size++; - } + Node pNode = head; + while(pNode.next != null){ + pNode = pNode.next; + size++; } return size; } public void addFirst(Object o){ - if(null == head){ - head = new Node(o); - head.next = null; - }else{ - Node pt = new Node(o); - pt.next = head; - head = pt; + if(size == 0){ + head.data = o; } + + Node newNode = new Node(o); + Node pNode = head; + head = newNode; + newNode.next = pNode.next; size++; } public void addLast(Object o){ - if(null == head){ - head = new Node(o); - head.next = null; - }else{ - Node pt = head; - while(pt.next != null){ - pt = pt.next; - } - pt.next = new Node(o); - Node pt1 = pt.next; - pt1.next = null; + if(size == 0){ + head.data = o; + } + + Node newNode = new Node(o); + Node pNode = head; + while(pNode.next != null){ + pNode = pNode.next; } + pNode.next = newNode; + newNode.next = null; size++; } public Object removeFirst(){ - if(null != head){ - Node pt = head; - head = pt.next; - size--; - return head.data; - }else{ + if(size == 0){ return null; } + + Node pNode = head; + head = pNode.next; + head.next = pNode.next.next; + size--; + return pNode; } public Object removeLast(){ - if(null != head){ - Node pt = head; - while(pt.next.next != null){ - pt = pt.next; - } - Node pt1 = pt.next; - pt.next = null; - size--; - return pt1.data; - }else{ + if(size == 0){ return null; } + + Node pNode = head; + Node node = new Node(null); + while(pNode.next != null){ + node = pNode; + pNode = pNode.next; + } + + node.next = null; + size--; + return pNode; } - public Iterator iterator(){ - return new LinkedListIterator(this); + return new LinkedListIterator(); } - private class LinkedListIterator implements Iterator { - LinkedList linkedlist = null; - int pos = 0; + //注意这一个问题 + public class LinkedListIterator implements Iterator { + private int position; - private LinkedListIterator(LinkedList linkedlist) { - this.linkedlist = linkedlist; - } @Override public boolean hasNext() { - pos++; - if(pos >= size){ - return false; - }else{ - return true; - } + return position < size(); } @Override public Object next() { - Node pt = head; - for(int i = 0; i < pos; i++ ){ - while(pt.next != null){ - pt = pt.next; + if(hasNext()){ + return get(position++); + } + return null; + } + + } + + public void checkIndex(int index){ + if(index < 0 || index >= size){ + throw new IndexOutOfBoundsException(); + } + } + + /** + * 把该链表逆置 + * 例如链表为 3->7->10 , 逆置后变为 10->7->3 + */ + public void reverse(Node head){ + if(head.next == null || head.next.next == null){ + return; + } + + Node p = head.next; + Node q = head.next.next; + Node t = null; + + while(q.next != null){ + t = q.next; + q.next = p; + p = q; + q = t; + } + + head.next.next = null;//设置链表尾部 + head.next = p;//设置链表头部 + } + + /** + * 删除一个单链表的前半部分 + * 例如：list = 2->5->7->8 , 删除以后的值为 7->8 + * 如果list = 2->5->7->8->10 ,删除以后的值为7,8,10 + + */ + public void removeFirstHalf(){ + if(size == 0 || head.next == null || head.next.next == null){ + return; + } + + Node pNode = head; + Node node = null; + for(int i = 0; i < size/2; i++){ + node = pNode; + pNode = pNode.next; + } + + if(size %2 == 0){ + head.next = pNode; + }else{ + head.next = node; + } + } + + /** + * 从第i个元素开始， 删除length 个元素 ， 注意i从0开始 + * @param i + * @param length + */ + public void remove(int i, int length){ + if(size == 0 || head.next == null){ + return; + } + + for(int k = i; k < i + length; k++){ + checkIndex(k); + remove(k); + } + } + /** + * 假定当前链表和list均包含已升序排列的整数 + * 从当前链表中取出那些list所指定的元素 + * 例如当前链表 = 11->101->201->301->401->501->601->701 + * list = 1->3->4->6 + * 返回的结果应该是[101,301,401,601] + * @param list + */ + public int[] getElements(LinkedList list){ + if(list.size == 0 || list == null){ + return new int[0]; + } + + int[] array = new int[list.size]; + int k = 0; + for(int i = 0; i < list.size; i++){ + int index = (int) list.get(i); + array[k] = (int) get(index); + } + return array; + } + + /** + * 已知链表中的元素以值递增有序排列，并以单链表作存储结构。 + * 从当前链表中中删除在list中出现的元素 + + * @param list + */ + + public void subtract(LinkedList list,LinkedList oldList){ + if(oldList == null || oldList.size ==0 || list == null || list.size == 0){ + return; + } + + for(int i = 0; i < oldList.size; i++){ + for(int j = 0; j < list.size; j++){ + if(list.get(j) == oldList.get(i)){ + oldList.remove(i); } } - return pt.data; + } + } + + /** + * 已知当前链表中的元素以值递增有序排列，并以单链表作存储结构。 + * 删除表中所有值相同的多余元素（使得操作后的线性表中所有元素的值均不相同） + */ + public void removeDuplicateValues(LinkedList list){ + if(list == null || list.size == 0){ + return; } + int count = 0; + Node pNode = head; + while(pNode.next != null){ + pNode = pNode.next; + count++; + if(pNode.data == pNode.next.data){ + list.remove(count+1); + } + } } - private static class Node{ - public Node(Object o) { - this.data = o; + /** + * 已知链表中的元素以值递增有序排列，并以单链表作存储结构。 + * 试写一高效的算法，删除表中所有值大于min且小于max的元素（若表中存在这样的元素） + * @param min + * @param max + */ + public void removeRange(int min, int max){ + if(size == 0){ + return; } - Object data; - Node next; + + int count = 0; + Node pNode = head; + while(pNode.next != null){ + pNode = pNode.next; + count++; + if(min < (int)pNode.data || (int)pNode.data < max){ + remove(count); + } + } + } + + /** + * 假设当前链表和参数list指定的链表均以元素依值递增有序排列（同一表中的元素值各不相同） + * 现要求生成新链表C，其元素为当前链表和list中元素的交集，且表C中的元素有依值递增有序排列 + * @param list + */ + public LinkedList intersection( LinkedList list){ + if(list.size == 0){ + return null; + } + + LinkedList listC = new LinkedList(); + Node p = head; + Node q = list.head; + + while(p.next != null){ + p = p.next; + while(q.next !=null){ + q = q.next; + if(p.data.equals(q.data)){ + listC.add(p); + } + } + } + return listC; } }