add

Author: codingWang

bin/com/duweri/interview/FinalTest.class

@@ -0,0 +1,25 @@
+package com.duweri.interview;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class FinalTest {
+	
+	public static void main(String[] args) {
+		int a = 10;
+		System.out.println((a>>1)+5);
+		System.out.println(a>>1);
+		System.out.println(a<<1);
+		final List<String> list = new ArrayList<>(10);
+		System.out.println(list.size());
+		for (int i = 0; i < 15; i++) {
+			list.add(i+"");
+		}
+		System.out.println(list.size());
+		for (String string : list) {
+			System.out.println(string);
+		}
+	}
+	
+
+}

bin/com/duweri/interview/SubStringTest.class

@@ -52,7 +52,7 @@ public static void shellSort(int[] arr){
 	 */
 	public static void bubbleSort(int[] arr){
 		for (int i = 0; i <arr.length-1; i++) {//从后往前推小的
-			for (int j = arr.length-1; j>i; j--) {
+			for (int j = arr.length-1; j>i; j--) {//从最后一个开始遍历
 				if (arr[j]>arr[j-1]) {
 					int temp = arr[j];//swap
 					arr[j] = arr[j-1];
@@ -64,9 +64,9 @@ public static void bubbleSort(int[] arr){
 
 	/**
 	 * 快速排序
-	 * 关键:1、选轴值
-	 * 	2、一次划分
-	 * 3、递归快排
+	 * 关键: 1、选轴值
+	 * 		2、一次划分
+	 * 		3、递归快排
 	 */
 	public static void quickSort(int[] arr,int start,int end){
 		if(start<end){

src/com/duweri/interview/FinalTest.java

@@ -0,0 +1,27 @@
+package com.duweri.interview;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class SubStringTest {
+	public static void main(String[] args) {
+		SubStringTest.out();
+	}
+
+	public static void out() {
+		String str = "我爱你们,你爱他,他爱她们加一,她爱他";
+		String temp = str + ",";
+		List<String> list = new ArrayList<>();
+		while (true) {
+			String splitStr = null; // 保留截取的字符串
+			int index = temp.indexOf(",");
+			if (index < 0) {
+				break;
+			}
+			splitStr = temp.substring(0, index);
+			//System.out.println(splitStr);
+			list.add(splitStr);
+			temp = temp.substring(index + 1);
+		}
+	}
+}