2016年09月_yoohoosome

原创归并排序

Version 1 /** * 归并排序 */ private static int[] mergeSort(int[] src, int start, int end) { if (start == end) { return new int[]{src[start]}; } int m

2016-09-25 19:54:05 358

原创字符串排序

/** * 字符串排序 * 输入：fed1l9u5u12 * 输出：11259defluu */public class StringSort { public static void main(String[] args) { String input = "fed1l9u5u12"; System.out.println(sort(input)

2016-09-25 19:12:12 317

原创围圈报数

import java.util.ArrayList;import java.util.Scanner;public class Baoshu { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int len = scanner.n

2016-09-21 22:42:38 508

原创大数相加

/** * Created by syh on 2016/9/20. * 大数相加 */public class BigNumber { public static void main(String[] args) { String num1 = "1045"; String num2 = "55"; System.out.print

2016-09-20 23:50:47 299

原创百度笔试

baidu 格子距离import java.util.Scanner;public class Main { public static String input = "2\n" + "3 3 1 1\n" + "8 0 0\n" + "2 0 0\n" + "1 4 0\n" +

2016-09-20 20:12:43 253

原创 Java中的矩阵使用

public class TestArr { public static void main(String[] args) { int m = 3; // m行 int n = 4; // n列 int[][] arr = new int[m][n]; // m行n列矩阵 = m个长度为n的数组 = 3个长度为4的数组 Sys

2016-09-20 19:39:02 1346

原创快速排序

参考public class QuickSort { public static int[][] midCases = { {1, 2, 3}, {2, 1, 3}, {3, 1, 2}, {2, 3, 1}, {1, 2}, {2, 1}}

2016-09-17 21:49:09 247

原创 [2017腾讯校招在线笔试题]

import java.util.ArrayList;import java.util.Scanner;public class Main { public static ArrayList rst = new ArrayList(); public static void main(String[] args) { Scanner in = new Sc

2016-09-11 20:52:26 5038 3

willshine19的专栏