edit author info

Liu Yuning · Liu Yuning · commit be1523eca126 · 2017-04-01T19:44:34.000+08:00
diff --git a/src/containers/Reverse.java b/src/containers/Reverse.java
@@ -8,54 +8,55 @@
 /**
  * 利用迭代器实现反转操作
  * 
- * @author liuyuning
+ * @author liu yuning
  * 
  *
  */
 public class Reverse {
-	@SuppressWarnings("serial")
-	private static class ReverseCollection<T> extends ArrayList<T> {
+    @SuppressWarnings("serial")
+    private static class ReverseCollection<T> extends ArrayList<T> {
 
-		public ReverseCollection(Collection<T> collection) {
-			super(collection);
-		}
+	public ReverseCollection(Collection<T> collection) {
+	    super(collection);
+	}
 
-		public Iterable<T> reverse() {
-			return new Iterable<T>() {
-
-				@Override
-				public Iterator<T> iterator() {
-					return new Iterator<T>() {
-						int current = size() - 1;
-
-						@Override
-						public boolean hasNext() {
-							return current > -1;
-						}
-
-						@Override
-						public T next() {
-							return get(current--);
-						}
-					};
-				}
-			};
-		}
+	public Iterable<T> reverse() {
+	    return new Iterable<T>() {
 
-	}
+		@Override
+		public Iterator<T> iterator() {
+		    return new Iterator<T>() {
+			int current = size() - 1;
 
-	public static String reverseWords(String s) {
-		ReverseCollection<String> reverseCollection = new ReverseCollection<String>(Arrays.asList(s.split(" ")));
-		StringBuilder stringBuilder = new StringBuilder();
-		for (String word : reverseCollection.reverse()) {
-			stringBuilder.append(word + " ");
-		}
-		return stringBuilder.toString().trim();
+			@Override
+			public boolean hasNext() {
+			    return current > -1;
+			}
 
+			@Override
+			public T next() {
+			    return get(current--);
+			}
+		    };
+		}
+	    };
 	}
 
-	public static void main(String[] args) {
-		String s = "This is a test for reversing words";
-		System.out.println(reverseWords(s));
+    }
+
+    public static String reverseWords(String s) {
+	ReverseCollection<String> reverseCollection = new ReverseCollection<String>(
+		Arrays.asList(s.split(" ")));
+	StringBuilder stringBuilder = new StringBuilder();
+	for (String word : reverseCollection.reverse()) {
+	    stringBuilder.append(word + " ");
 	}
+	return stringBuilder.toString().trim();
+
+    }
+
+    public static void main(String[] args) {
+	String s = "This is a test for reversing words";
+	System.out.println(reverseWords(s));
+    }
 }
diff --git a/src/datastructure/Stack.java b/src/datastructure/Stack.java
@@ -3,78 +3,78 @@
 /**
  * 使用Java泛型实现栈
  * 
- * @author liuyuning
+ * @author liu yuning
  *
  * @param <T>
  */
 public class Stack<T> {
 
-	private static class Node<U> {
-		private U value;
-		private Node<U> next;
+    private static class Node<U> {
+	private U value;
+	private Node<U> next;
 
-		public Node() {
-			value = null;
-			next = null;
-		}
-
-		public Node(U value, Node<U> next) {
-			this.value = value;
-			this.next = next;
-		}
-
-		/**
-		 * 判断栈是否为空
-		 * 
-		 * @return true 如果为空；否则，false
-		 */
-		public boolean empty() {
-			return value == null && next == null;
-		}
+	public Node() {
+	    value = null;
+	    next = null;
 	}
 
-	/**
-	 * 定义栈顶元素
-	 */
-	private Node<T> top = new Node<T>();
+	public Node(U value, Node<U> next) {
+	    this.value = value;
+	    this.next = next;
+	}
 
 	/**
-	 * 入栈操作
+	 * 判断栈是否为空
 	 * 
-	 * @param value
-	 *            入栈元素的值
+	 * @return true 如果为空；否则，false
 	 */
-	public void push(T value) {
-		top = new Node<T>(value, top);
+	public boolean empty() {
+	    return value == null && next == null;
 	}
+    }
 
-	/**
-	 * 出栈操作
-	 * 
-	 * @return 栈顶元素的值
-	 */
-	public T pop() {
-		T value = top.value;
-		if (!top.empty()) {
-			top = top.next;
-		}
-		return value;
+    /**
+     * 定义栈顶元素
+     */
+    private Node<T> top = new Node<T>();
+
+    /**
+     * 入栈操作
+     * 
+     * @param value
+     *            入栈元素的值
+     */
+    public void push(T value) {
+	top = new Node<T>(value, top);
+    }
+
+    /**
+     * 出栈操作
+     * 
+     * @return 栈顶元素的值
+     */
+    public T pop() {
+	T value = top.value;
+	if (!top.empty()) {
+	    top = top.next;
 	}
+	return value;
+    }
 
-	public static void main(String[] args) {
-		Stack<String> stack = new Stack<String>();
-		String string = "This is a test for stack";
+    public static void main(String[] args) {
+	Stack<String> stack = new Stack<String>();
+	String string = "This is a test for stack";
 
-		System.out.println("入栈元素(String)依次为：");
-		for (String nodeIn : string.split(" ")) {
-			stack.push(nodeIn);
-			System.out.println(nodeIn);
-		}
+	System.out.println("入栈元素(String)依次为：");
+	for (String nodeIn : string.split(" ")) {
+	    stack.push(nodeIn);
+	    System.out.println(nodeIn);
+	}
 
-		System.out.println("出栈元素(String)依次为：");
-		String nodeOut;
-		while ((nodeOut = stack.pop()) != null) {
-			System.out.println(nodeOut);
-		}
+	System.out.println("出栈元素(String)依次为：");
+	String nodeOut;
+	while ((nodeOut = stack.pop()) != null) {
+	    System.out.println(nodeOut);
 	}
+    }
 }
