<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[willshine19的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/willshine19</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; willshine19]]></copyright><item><title><![CDATA[华为笔试]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52779390</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52779390</guid><author>willshine19</author><pubDate>Mon, 10 Oct 2016 17:01:48 +0800</pubDate><description><![CDATA[package huawei;

import java.util.ArrayList;
import java.util.Scanner;

/**
 * 和尚挑水
 */
public class FindWater {
    private static final String inCase = "1 0 0 1 0 1 0\n" +
            "0 0 1 1 0 0 0]]></description><category></category></item><item><title><![CDATA[归并排序]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52663843</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52663843</guid><author>willshine19</author><pubDate>Sun, 25 Sep 2016 19:54:05 +0800</pubDate><description><![CDATA[Version 1
    /**
     * 归并排序
     */
    private static int[] mergeSort(int[] src, int start, int end) {
        if (start == end) {
            return new int[]{src[start]};
        }
        int m]]></description><category></category></item><item><title><![CDATA[字符串排序]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52663611</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52663611</guid><author>willshine19</author><pubDate>Sun, 25 Sep 2016 19:12:12 +0800</pubDate><description><![CDATA[/**
 * 字符串排序
 * 输入：fed1l9u5u12
 * 输出：11259defluu
 */
public class StringSort {
    public static void main(String[] args) {
        String input = "fed1l9u5u12";
        System.out.println(sort(input)]]></description><category></category></item><item><title><![CDATA[围圈报数]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52614317</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52614317</guid><author>willshine19</author><pubDate>Wed, 21 Sep 2016 22:42:38 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[大数相加]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52602085</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52602085</guid><author>willshine19</author><pubDate>Tue, 20 Sep 2016 23:50:47 +0800</pubDate><description><![CDATA[/**
 * 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]]></description><category></category></item><item><title><![CDATA[百度笔试]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52599494</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52599494</guid><author>willshine19</author><pubDate>Tue, 20 Sep 2016 20:12:43 +0800</pubDate><description><![CDATA[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" +]]></description><category></category></item><item><title><![CDATA[Java中的矩阵使用]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52599205</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52599205</guid><author>willshine19</author><pubDate>Tue, 20 Sep 2016 19:39:02 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52565739</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52565739</guid><author>willshine19</author><pubDate>Sat, 17 Sep 2016 21:49:09 +0800</pubDate><description><![CDATA[参考
public class QuickSort {

    public static int[][] midCases = {
            {1, 2, 3},
            {2, 1, 3},
            {3, 1, 2},
            {2, 3, 1},
            {1, 2},
            {2, 1}}]]></description><category></category></item><item><title><![CDATA[[2017腾讯校招在线笔试题]]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/52506309</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/52506309</guid><author>willshine19</author><pubDate>Sun, 11 Sep 2016 20:52:26 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[ArrayList的contains方法与Object的equals方法的关系]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51120121</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51120121</guid><author>willshine19</author><pubDate>Mon, 11 Apr 2016 11:17:37 +0800</pubDate><description><![CDATA[ArrayList的contains方法判断两个元素是否为同一元素的标准是该元素（姑且当做Object）的equals方法。下面的例子可以说明问题。


public static void main(String[] args) {
		String str1 = new String("sangyaohui");
		String str2 = new String("sangyaohu]]></description><category></category></item><item><title><![CDATA[[剑指offer][第四章][28]字符串的排列]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51119931</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51119931</guid><author>willshine19</author><pubDate>Mon, 11 Apr 2016 11:03:41 +0800</pubDate><description><![CDATA[[牛客网]字符串测排列
题目理解：题目个给的字符串中可能包含重复的字符，你给出的解中也要包含这些重复的字符，但是解集中不应该包含重复的解。
import java.util.ArrayList;
public class Solution {
    public ArrayList Permutation(String str) {
        // 2016-04-11
       ]]></description><category></category></item><item><title><![CDATA[[剑指offer][第四章][25]Binary Tree Path Sum]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51119269</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51119269</guid><author>willshine19</author><pubDate>Mon, 11 Apr 2016 09:57:48 +0800</pubDate><description><![CDATA[[LintCode]Binary Tree Path Sum
/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.v]]></description><category></category></item><item><title><![CDATA[[2016.4][京东暑期实习笔试]三子棋]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51099711</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51099711</guid><author>willshine19</author><pubDate>Fri, 08 Apr 2016 21:26:11 +0800</pubDate><description><![CDATA[package bupt.syh;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scan]]></description><category></category></item><item><title><![CDATA[[2016.4][京东暑期实习笔试]生日礼物]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51099690</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51099690</guid><author>willshine19</author><pubDate>Fri, 08 Apr 2016 21:22:23 +0800</pubDate><description><![CDATA[package bupt.syh;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	private static Envelope card;
	public static void main(String[] args) {
		Scanner]]></description><category></category></item><item><title><![CDATA[[剑指offer][第三章][12] Print Numbers by Recursion]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51096847</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51096847</guid><author>willshine19</author><pubDate>Fri, 08 Apr 2016 15:04:23 +0800</pubDate><description><![CDATA[[LintCode]Print Numbers by Recursion
Version 1
public class Solution {
    /**
     * @param n: An integer.
     * return : An array storing 1 to the largest number with n digits.
     */
    public]]></description><category></category></item><item><title><![CDATA[[剑指offer][第三章][18]Subtree]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51096390</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51096390</guid><author>willshine19</author><pubDate>Fri, 08 Apr 2016 14:17:23 +0800</pubDate><description><![CDATA[[LintCode]Subtree
/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 * ]]></description><category></category></item><item><title><![CDATA[[剑指offer][第三章][14]Partition Array by Odd and Even]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51094286</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51094286</guid><author>willshine19</author><pubDate>Fri, 08 Apr 2016 10:33:58 +0800</pubDate><description><![CDATA[[LintCode]Partition Array by Odd and Even
public class Solution {
    /**
     * @param nums: an array of integers
     * @return: nothing
     */
    public void partitionArray(int[] nums) {]]></description><category></category></item><item><title><![CDATA[[2016.4][微软笔试]Font Size]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51087244</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51087244</guid><author>willshine19</author><pubDate>Thu, 07 Apr 2016 16:57:00 +0800</pubDate><description><![CDATA[题目1 : Font Size
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int caseNum = in.nextInt();
        int ]]></description><category></category></item><item><title><![CDATA[[刷题]Maximum Subarray II]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51072220</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51072220</guid><author>willshine19</author><pubDate>Wed, 06 Apr 2016 09:52:16 +0800</pubDate><description><![CDATA[[LintCode]Maximum Subarray II
public class Solution {
    /**
     * @param nums: A list of integers
     * @return: An integer denotes the sum of max two non-overlapping subarrays
     */
    public]]></description><category></category></item><item><title><![CDATA[[hiho]后序遍历]]></title><link>https://blog.youkuaiyun.com/willshine19/article/details/51065492</link><guid>https://blog.youkuaiyun.com/willshine19/article/details/51065492</guid><author>willshine19</author><pubDate>Tue, 05 Apr 2016 16:01:20 +0800</pubDate><description><![CDATA[[hiho]后序遍历
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		while (in.hasNext()) {
			String pre = in.nextLine();
]]></description><category></category></item></channel></rss>