<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Davy_Joe的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Davy_Joe</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Davy_Joe]]></copyright><item><title><![CDATA[LeetCode 371. Sum of Two Integers]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54846408</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54846408</guid><author>Davy_Joe</author><pubDate>Fri, 03 Feb 2017 13:21:54 +0800</pubDate><description><![CDATA[原题： 
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example: 
Given a = 1 and b = 2, return 3.题意： 
计算两个整数a和b的和，但是你不允许使用操作符+和-。例子： 
给定a=1和b=2，返回3。思路： 
利用两]]></description><category></category></item><item><title><![CDATA[LeetCode 136. Single Number(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54729988</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54729988</guid><author>Davy_Joe</author><pubDate>Wed, 25 Jan 2017 15:56:43 +0800</pubDate><description><![CDATA[原题： 
Given an array of integers, every element appears twice except for one. Find that single one.Note: 
Your algorithm should have a linear runtime complexity. Could you implement it without using ext]]></description><category></category></item><item><title><![CDATA[LeetCode 492. Construct the Rectangle(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54696978</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54696978</guid><author>Davy_Joe</author><pubDate>Mon, 23 Jan 2017 23:02:14 +0800</pubDate><description><![CDATA[原题： 
For a web developer, it is very important to know how to design a web page’s size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose leng]]></description><category></category></item><item><title><![CDATA[LeetCode 448. Find All Numbers Disappeared in an Array(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54696352</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54696352</guid><author>Davy_Joe</author><pubDate>Mon, 23 Jan 2017 22:38:15 +0800</pubDate><description><![CDATA[原题： 
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Coul]]></description><category></category></item><item><title><![CDATA[LeetCode 292. Nim Game(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54671129</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54671129</guid><author>Davy_Joe</author><pubDate>Sun, 22 Jan 2017 21:34:38 +0800</pubDate><description><![CDATA[原题： 
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be]]></description><category></category></item><item><title><![CDATA[LeetCode 463. Island Perimeter(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54645317</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54645317</guid><author>Davy_Joe</author><pubDate>Sat, 21 Jan 2017 11:52:02 +0800</pubDate><description><![CDATA[原题： 
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is complet]]></description><category></category></item><item><title><![CDATA[LeetCode 344. Reverse String(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54620007</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54620007</guid><author>Davy_Joe</author><pubDate>Thu, 19 Jan 2017 22:25:44 +0800</pubDate><description><![CDATA[原题： 
Write a function that takes a string as input and returns the string reversed.Example: 
Given s = “hello”, return “olleh”.题意： 
写一个方法可以将输入的字符串反转并返回。思路： 
1.将字符串转化为字符数组； 
2.对字符数组关于中间对称的元素进行交换； 
3.将字符]]></description><category></category></item><item><title><![CDATA[LeetCode 412. Fizz Buzz(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54619858</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54619858</guid><author>Davy_Joe</author><pubDate>Thu, 19 Jan 2017 22:13:57 +0800</pubDate><description><![CDATA[原题： 
Write a program that outputs the string representation of numbers from 1 to n.But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”.]]></description><category></category></item><item><title><![CDATA[LeetCode 485. Max Consecutive Ones(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54619671</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54619671</guid><author>Davy_Joe</author><pubDate>Thu, 19 Jan 2017 21:45:33 +0800</pubDate><description><![CDATA[原题： 
Given a binary array, find the maximum number of consecutive 1s in this array.Example 1: 
Input: [1,1,0,1,1,1] 
Output: 3 
Explanation: The first two digits or the last three digits are consecutiv]]></description><category></category></item><item><title><![CDATA[LeetCode 476. Number Complement(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54619533</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54619533</guid><author>Davy_Joe</author><pubDate>Thu, 19 Jan 2017 21:20:34 +0800</pubDate><description><![CDATA[原题： 
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note: 
The given integer is guaranteed to fit within the range of a]]></description><category></category></item><item><title><![CDATA[LeetCode 2. Add Two Numbers(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54430125</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54430125</guid><author>Davy_Joe</author><pubDate>Sat, 14 Jan 2017 23:33:58 +0800</pubDate><description><![CDATA[原题： 
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retu]]></description><category></category></item><item><title><![CDATA[LeetCode 1. Two Sum(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54412658</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54412658</guid><author>Davy_Joe</author><pubDate>Fri, 13 Jan 2017 23:07:44 +0800</pubDate><description><![CDATA[原题： 
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example: 
Given nums = [2, 7]]></description><category></category></item><item><title><![CDATA[LeetCode 461. Hamming Distance(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/54169715</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/54169715</guid><author>Davy_Joe</author><pubDate>Sat, 07 Jan 2017 08:12:52 +0800</pubDate><description><![CDATA[原题： 
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note: 
0 ≤ x, y < 231.]]></description><category></category></item><item><title><![CDATA[LeetCode 350. Intersection of Two Arrays II（Java）]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/53512084</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/53512084</guid><author>Davy_Joe</author><pubDate>Wed, 07 Dec 2016 23:59:30 +0800</pubDate><description><![CDATA[原题： 
Given two arrays, write a function to compute their intersection.Example: 
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: 
Each element in the result should appear as many times a]]></description><category></category></item><item><title><![CDATA[LeetCode 217. Contains Duplicate（Java）]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/53511830</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/53511830</guid><author>Davy_Joe</author><pubDate>Wed, 07 Dec 2016 23:25:32 +0800</pubDate><description><![CDATA[原题： 
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every elemen]]></description><category></category></item><item><title><![CDATA[LeetCode 409. Longest Palindrome(Java)]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/53492507</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/53492507</guid><author>Davy_Joe</author><pubDate>Tue, 06 Dec 2016 20:12:38 +0800</pubDate><description><![CDATA[题目： 
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example “Aa” is not con]]></description><category></category></item><item><title><![CDATA[LeetCode 169. Majority Element（Java）]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/53491753</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/53491753</guid><author>Davy_Joe</author><pubDate>Tue, 06 Dec 2016 19:30:19 +0800</pubDate><description><![CDATA[题目： 
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element al]]></description><category></category></item><item><title><![CDATA[单例模式（懒汉模式与饿汉模式）]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/52873156</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/52873156</guid><author>Davy_Joe</author><pubDate>Thu, 20 Oct 2016 15:33:21 +0800</pubDate><description><![CDATA[1.单例模式： 
应用场景：当系统中只需要一个对象就够了，如任务管理器、古代皇帝、现代老婆 
作用：保证在一个系统中有且只有一个实例 
类型：饿汉模式、懒汉模式2.饿汉模式：public class Singleton {
    //1.私有化构造方法，让其他类无法通过new的方式创建该类的实例
    private Singleton(){
    }    //2.创建类的唯一实例,使用pr]]></description><category></category></item><item><title><![CDATA[Tomcat Jboss Apache WebLogic区别与比较]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/52850876</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/52850876</guid><author>Davy_Joe</author><pubDate>Tue, 18 Oct 2016 17:35:23 +0800</pubDate><description><![CDATA[1.Tomcat是Apache鼎力支持的Java Web应用服务器，由于它优秀的稳定性以及丰富的文档资料，广泛的使用人群，从而在开源领域受到最广泛的青睐。­实际上Tomcat 部分是Apache 服务 器的扩展，但它是独立运行的，所以当你运行tomcat 时，它实际上作为一个与Apache 独立的进 程单独运行的。2.Apache全球应用最广泛的http服务器，免费，出自apache基金组织.apa]]></description><category></category></item><item><title><![CDATA[Java的四种引用，强弱软虚，用到的场景]]></title><link>https://blog.youkuaiyun.com/Davy_Joe/article/details/52850621</link><guid>https://blog.youkuaiyun.com/Davy_Joe/article/details/52850621</guid><author>Davy_Joe</author><pubDate>Tue, 18 Oct 2016 17:14:56 +0800</pubDate><description><![CDATA[java中的4种reference的差别和使用场景(含理论.代码和执行结果)我们知道Java语言提供了4种引用类型：强引用、软引用(SoftReference)、弱引用（WeakReference）和幽灵引用（PhantomReference），与引用密切相关的，还有一个引用队列ReferenceQueue。引用和引用队列的关系，对于垃圾回收来说非常重要，学习垃圾回收机制，必须要先了解引用和引用队列]]></description><category></category></item></channel></rss>