Merge pull request onlyliuxin#3 from khalil2333/master

nusubmarine01 · web-flow · commit da249e7a7331 · 2017-02-24T20:00:13.000+08:00
Master
diff --git a/group03/1753176091/bin/.gitignore b/group03/1753176091/bin/.gitignore
@@ -0,0 +1 @@
+/com/
diff --git a/group03/1753176091/src/com/coding/basic/ArrayList.java b/group03/1753176091/src/com/coding/basic/ArrayList.java
@@ -0,0 +1,56 @@
+package com.coding.basic;
+
+import java.util.Arrays;
+
+public class ArrayList implements List {
+
+	private int size = 0;
+
+	private Object[] elementData = new Object[100];
+
+	public void add(Object o) {
+		ensureCapacity(size + 1);
+		elementData[size++] = o;
+	}
+
+	private void ensureCapacity(int minCapacity) {
+		if (minCapacity > 100) {
+			grow(elementData);
+		}
+	}
+
+	private void grow(Object[] elementData) {
+		int oldLength = elementData.length;
+		int newLength = oldLength * 2;
+		Arrays.copyOf(elementData, newLength);
+	}
+
+	public void add(int index, Object o) {
+		ensureCapacity(size + 1);
+		System.arraycopy(elementData, index, elementData, index + 1, size - index);
+		elementData[index] = o;
+	}
+
+	public Object get(int index) {
+		if (index < 0 || index > elementData.length) {
+			throw new IndexOutOfBoundsException();
+		}
+		return (Object) elementData[index];
+	}
+
+	public Object remove(int index) {
+		int lowLength = size - index - 1;
+		System.arraycopy(elementData, index + 1, elementData, index, lowLength);
+		elementData[--size] = null;
+		return (Object) elementData[index];
+	}
+
+	public int size() {
+		return size;
+	}
+
+	public Iterator iterator() {
+		return null;
+	}
+
+}
diff --git a/group03/1753176091/src/com/coding/basic/BinaryTreeNode.java b/group03/1753176091/src/com/coding/basic/BinaryTreeNode.java
@@ -0,0 +1,32 @@
+package com.coding.basic;
+
+public class BinaryTreeNode {
+	
+	private Object data;
+	private BinaryTreeNode left;
+	private BinaryTreeNode right;
+	
+	public Object getData() {
+		return data;
+	}
+	public void setData(Object data) {
+		this.data = data;
+	}
+	public BinaryTreeNode getLeft() {
+		return left;
+	}
+	public void setLeft(BinaryTreeNode left) {
+		this.left = left;
+	}
+	public BinaryTreeNode getRight() {
+		return right;
+	}
+	public void setRight(BinaryTreeNode right) {
+		this.right = right;
+	}
+	
+	public BinaryTreeNode insert(Object o){
+		return  null;
+	}
+	
+}
diff --git a/group03/1753176091/src/com/coding/basic/FileUtil.java b/group03/1753176091/src/com/coding/basic/FileUtil.java
@@ -0,0 +1,68 @@
+package com.coding.basic;
+
+
+
+import java.io.BufferedInputStream;
+import java.io.ByteArrayOutputStream;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
+
+public class FileUtil {
+	
+	public  static String byteToHexString(byte[] codes ){
+		
+		StringBuffer buffer = new StringBuffer();
+		
+		for(int i=0;i<codes.length;i++){
+			byte b = codes[i];
+			int value = b & 0xFF;
+			String strHex = Integer.toHexString(value);
+			if(strHex.length()< 2){
+				strHex = "0" + strHex;
+			}		
+			buffer.append(strHex);
+		}
+		return buffer.toString();
+	}
+	
+	public  static byte[] readByteCodes(String clzFileName) throws IOException  {
+		
+		File f = new File(clzFileName);		
+					
+		BufferedInputStream bis =  new BufferedInputStream(new FileInputStream(f));
+		
+		ByteArrayOutputStream bos = new ByteArrayOutputStream();
+		
+		
+		byte[] buffer = new byte[1024];
+		int length = -1;		
+		try {
+			while((length = bis.read(buffer)) != -1){
+				bos.write(buffer, 0, length);				
+			}
+		} catch (IOException e) {			
+			e.printStackTrace();
+			throw e;
+		} finally{
+			if(bis != null){
+				bis.close();
+			}
+			if(bos !=null){
+				bos.close();
+			}
+		}
+		
+		byte [] codes = bos.toByteArray();
+		
+		bis.close();
+		
+		return codes;
+	}
+	public static void main(String[] args) throws IOException{
+		byte[] codes = FileUtil.readByteCodes("C:\\coderising\\workspace_ds\\Warmup\\bin\\FileUtil.class");;
+		
+		String hexCodes = FileUtil.byteToHexString(codes);
+		System.out.println(hexCodes);
+	}
+}
diff --git a/group03/1753176091/src/com/coding/basic/Iterator.java b/group03/1753176091/src/com/coding/basic/Iterator.java
@@ -0,0 +1,7 @@
+package com.coding.basic;
+
+public interface Iterator {
+	public boolean hasNext();
+	public Object next();
+
+}
diff --git a/group03/1753176091/src/com/coding/basic/LinkedList.java b/group03/1753176091/src/com/coding/basic/LinkedList.java
@@ -0,0 +1,120 @@
+package com.coding.basic;
+
+import java.util.NoSuchElementException;
+
+public class LinkedList implements List {
+
+	private Node head;
+	private int size;
+
+	public void add(Object o) {
+
+		Node newHead = new Node(o, null);
+		Node f = head;
+		for (int i = 0; i < size - 1; i++) {
+			f = f.next;
+		}
+		f.next = newHead;
+		size++;
+
+	}
+
+	public void add(int index, Object o) {
+		if (index >= size || index < 0) {
+			throw new IndexOutOfBoundsException();
+		}
+		Node newHead = new Node(o, null);
+		Node f = head;
+		for (int i = 0; i < index - 1; i++) {
+			f = f.next;
+		}
+		newHead.next = f.next;
+		f.next = newHead;
+		size++;
+	}
+
+	public Object get(int index) {
+		if (index >= size || index < 0) {
+			throw new IndexOutOfBoundsException();
+		}
+		Node f = head;
+		for (int i = 0; i < index; i++) {
+			f = f.next;
+		}
+		return f.data;
+	}
+
+	public Object remove(int index) {
+		if (index >= size || index < 0) {
+			throw new IndexOutOfBoundsException();
+		}
+		Node f = head;
+		for (int i = 0; i < index - 1; i++) {
+			f = f.next;
+		}
+		f.next = f.next.next;
+		final Node d = f.next;
+		final Object element = d.data;
+		d.data = null;
+		d.next = null;
+		size--;
+		return element;
+	}
+
+	public int size() {
+		return size;
+	}
+
+	public void addFirst(Object o) {
+		Node newHead = new Node(o, head);
+		head = newHead;
+		size++;
+	}
+
+	public void addLast(Object o) {
+		Node newHead = new Node(o, null);
+		Node f = head;
+		for (int i = 0; i < size - 1; i++) {
+			f = f.next;
+		}
+		f.next = newHead;
+		size++;
+	}
+
+	public Object removeFirst() {
+		final Node f = head;
+		if (f == null)
+			throw new NoSuchElementException();
+		final Object element = f.data;
+		head = f.next;
+		f.data = null;
+		f.next = null;
+		size--;
+		return element;
+	}
+
+	public Object removeLast() {
+		Node f = head;
+		for (int i = 0; i < size - 2; i++) {
+			f = f.next;
+		}
+		Object element = f.next;
+		f.next = null;
+		size--;
+		return element;
+	}
+
+	public Iterator iterator() {
+		return null;
+	}
+
+	private static class Node {
+		Object data;
+		Node next;
+
+		private Node(Object data, Node next) {
+			this.data = data;
+			this.next = next;
+		}
+	}
+}
diff --git a/group03/1753176091/src/com/coding/basic/List.java b/group03/1753176091/src/com/coding/basic/List.java
@@ -0,0 +1,9 @@
+package com.coding.basic;
+
+public interface List {
+	public void add(Object o);
+	public void add(int index, Object o);
+	public Object get(int index);
+	public Object remove(int index);
+	public int size();
+}
diff --git a/group03/1753176091/src/com/coding/basic/Queue.java b/group03/1753176091/src/com/coding/basic/Queue.java
@@ -0,0 +1,25 @@
+package com.coding.basic;
+
+public class Queue {
+
+	private int size;
+	LinkedList elementData = new LinkedList();
+
+	public void enQueue(Object o) {
+		elementData.addLast(o);
+		size++;
+	}
+
+	public Object deQueue() {
+		size--;
+		return elementData.removeFirst();
+	}
+
+	public boolean isEmpty() {
+		return size == 0;
+	}
+
+	public int size() {
+		return size;
+	}
+}
diff --git a/group03/1753176091/src/com/coding/basic/Stack.java b/group03/1753176091/src/com/coding/basic/Stack.java
@@ -0,0 +1,28 @@
+package com.coding.basic;
+
+public class Stack {
+	private ArrayList elementData = new ArrayList();
+	private int size = 0;
+
+	public void push(Object o) {
+		elementData.add(o);
+	}
+
+	public Object pop() {
+		if (size > 0)
+			return elementData.remove(size);
+		return null;
+	}
+
+	public Object peek() {
+		return elementData.get(size);
+	}
+
+	public boolean isEmpty() {
+		return size == 0;
+	}
+
+	public int size() {
+		return size;
+	}
+}
