<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[github_31804537的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/github_31804537</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; github_31804537]]></copyright><item><title><![CDATA[670. Maximum Swap]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/77850855</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/77850855</guid><author>github_31804537</author><pubDate>Tue, 05 Sep 2017 14:11:32 +0800</pubDate><description><![CDATA[需要注意的关键是相同的数字的处理class Solution {
    public int maximumSwap(int num) {
        char[]nums = String.valueOf(num).toCharArray();
        for (int i = 0; i < nums.length; i++) {
            char max = num]]></description><category></category></item><item><title><![CDATA[2. Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/77817002</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/77817002</guid><author>github_31804537</author><pubDate>Sun, 03 Sep 2017 12:12:44 +0800</pubDate><description><![CDATA[class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode preNode = new ListNode(0);
        ListNode tail = preNode;
        int pre = 0;
        while (l1!=null&]]></description><category></category></item><item><title><![CDATA[20. Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/77816053</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/77816053</guid><author>github_31804537</author><pubDate>Sun, 03 Sep 2017 09:58:48 +0800</pubDate><description><![CDATA[class Solution {
    public boolean isValid(String s) {
        char[]symbols = s.toCharArray();
        Stack<Character> stack = new Stack<>();
        for (int i = 0; i < symbols.length; i++) {]]></description><category></category></item><item><title><![CDATA[17. Letter Combinations of a Phone Number]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/77815928</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/77815928</guid><author>github_31804537</author><pubDate>Sun, 03 Sep 2017 09:40:24 +0800</pubDate><description><![CDATA[class Solution {
    public List<String> letterCombinations(String digits) {
       LinkedList<String> ans = new LinkedList<String>();
        String[] mapping = new String[] {"0", "1", "abc", "def", "]]></description><category></category></item><item><title><![CDATA[650. 2 Keys Keyboard]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/77767765</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/77767765</guid><author>github_31804537</author><pubDate>Fri, 01 Sep 2017 10:00:22 +0800</pubDate><description><![CDATA[比如说2为2次才能得到，那么4需要4次，6需要5次，8需要6次。class Solution {
        public int minSteps(int n) {
        if(n==1)return 0;
        int[]dp= new int[n];
        for (int i = 0; i < n; i++) {
            dp[i] = i+]]></description><category></category></item><item><title><![CDATA[647. Palindromic Substrings]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/77404468</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/77404468</guid><author>github_31804537</author><pubDate>Sat, 19 Aug 2017 10:24:18 +0800</pubDate><description><![CDATA[class Solution {
   public int countSubstrings(String s) {
        boolean[][] dp = new boolean[s.length()][s.length()];
        int result = 0;
        for (int i = 0; i < s.length(); i++) {]]></description><category></category></item><item><title><![CDATA[540. Single Element in a Sorted Array]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/72860802</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/72860802</guid><author>github_31804537</author><pubDate>Sun, 04 Jun 2017 19:22:41 +0800</pubDate><description><![CDATA[这道题从中间开始找，然后看左边长度是偶数，还是奇数，往是长度是奇数的那边找public class Solution {
    public int singleNonDuplicate(int[] nums) {
        int mid = nums.length/2;
        return findSingle(nums,0,nums.length-1);
    }    p]]></description><category></category></item><item><title><![CDATA[71. Simplify Path]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/72852483</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/72852483</guid><author>github_31804537</author><pubDate>Sat, 03 Jun 2017 15:46:33 +0800</pubDate><description><![CDATA[这道题，比较简单，主要用链表来对路径进行操作，”.”的话，list就直接跳过，”..”的话，list删除尾节点，其他的都是放入尾节点public class Solution {
    public String simplifyPath(String path) {
        LinkedList<String > list = new LinkedList<String>();]]></description><category></category></item><item><title><![CDATA[hive配置]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/70244343</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/70244343</guid><author>github_31804537</author><pubDate>Wed, 19 Apr 2017 19:35:16 +0800</pubDate><description><![CDATA[今天花了一个上午配置hive，途中遇到太多的坑，最后总算配置成功了 
第一个坑就是我的文件夹是没有hive-default.xml，但他给了hive-defualt的template所以要先输入下面命令cd /usr/local/Cellar/hive/2.1.9/libexec/conf;cp hive-dfault.xml.template hive-defalut.xml,没有这个文件即使配置]]></description><category></category></item><item><title><![CDATA[mac配置hadoop伪分布式]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/70168358</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/70168358</guid><author>github_31804537</author><pubDate>Fri, 14 Apr 2017 09:32:43 +0800</pubDate><description><![CDATA[首先先用brew下载hadoopbrew install hadoop它的xml文件都在/usr/local/Celler/hadoop/2.7.3/libexec/etc/hadoop下 
接着一步一步修改文件
修改core-site.xml
.xml<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" hr]]></description><category></category></item><item><title><![CDATA[57. Insert Interval]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/61202294</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/61202294</guid><author>github_31804537</author><pubDate>Fri, 10 Mar 2017 17:55:56 +0800</pubDate><description><![CDATA[/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */]]></description><category></category></item><item><title><![CDATA[306. Additive Number]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/60767223</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/60767223</guid><author>github_31804537</author><pubDate>Tue, 07 Mar 2017 16:13:26 +0800</pubDate><description><![CDATA[public class Solution {
    public boolean isAdditiveNumber(String num) {
        long first = 0;//这是第一个数
        long second = 0;//这是第二个数
        long third = 0;//这是第三个数
        String values = "";]]></description><category></category></item><item><title><![CDATA[207. Course Schedule]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/57405769</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/57405769</guid><author>github_31804537</author><pubDate>Sun, 26 Feb 2017 11:20:28 +0800</pubDate><description><![CDATA[构造了图结构，在外部用了dfs，最后计算hasCyclepublic class Solution {
    boolean hasCycle = false;
    Set set = new HashSet<Integer>();
    class DGraph{
        int n ;
        private boolean[] marked;        privat]]></description><category></category></item><item><title><![CDATA[165. Compare Version Numbers]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/57082856</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/57082856</guid><author>github_31804537</author><pubDate>Sat, 25 Feb 2017 15:34:38 +0800</pubDate><description><![CDATA[这道题通过“.”划分成数组，在一个一个数组比较public class Solution {
    public int compareVersion(String version1, String version2) {
        String []versionl1 = version1.split("\\.");
        String []versionl2 = version]]></description><category></category></item><item><title><![CDATA[23. Merge k Sorted Lists]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/54807978</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/54807978</guid><author>github_31804537</author><pubDate>Wed, 01 Feb 2017 11:07:56 +0800</pubDate><description><![CDATA[17 ms, 完全的merge方法， 就是将一个数组，不停的分成两个数组，进行合并，基本类似于合并排序/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 *]]></description><category></category></item><item><title><![CDATA[208. Implement Trie (Prefix Tree)]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/54729695</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/54729695</guid><author>github_31804537</author><pubDate>Wed, 25 Jan 2017 14:49:59 +0800</pubDate><description><![CDATA[public class Trie {    class node{
        int count = 0;//  用来删除，计数删除,虽然没有删除
        node[] nodes = new node[26];
        boolean isEnd = false;
    }
    private node root;
    /** Initialize your da]]></description><category></category></item><item><title><![CDATA[135. Candy]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/54645863</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/54645863</guid><author>github_31804537</author><pubDate>Sat, 21 Jan 2017 14:34:58 +0800</pubDate><description><![CDATA[举一个例子，1，2，3，4，3，4，1 ，小朋友得到的糖分别是1,2,3,4,1,2,1 
有特殊情况比如1,2,3,2,2,2小朋友得到的糖是1，2，3，1，1，1； 
所以有三种情况一种是递增，一种是递减，一种是相等public class Solution {
    private int count;
    public int candy(int[] ratings) {]]></description><category></category></item><item><title><![CDATA[117. Populating Next Right Pointers in Each Node II]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/54629271</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/54629271</guid><author>github_31804537</author><pubDate>Fri, 20 Jan 2017 10:04:27 +0800</pubDate><description><![CDATA[public class Solution {
   public void connect(TreeLinkNode root) {
        if (root == null) return;
        TreeLinkNode pre = root;
        TreeLinkNode cur = root;
        TreeLinkNode lastNode = r]]></description><category></category></item><item><title><![CDATA[131. Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/54427277</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/54427277</guid><author>github_31804537</author><pubDate>Sat, 14 Jan 2017 16:16:11 +0800</pubDate><description><![CDATA[这里我用了搜索，比较常规，关键有一点，你删除之前加入的值，是按索引来删除，而不是删除值，不然顺序会出错。public class Solution {
     public List<List<String>> partition(String s) {        List<List<String>>lists = new ArrayList<>();
        List<String]]></description><category></category></item><item><title><![CDATA[41. First Missing Positive]]></title><link>https://blog.youkuaiyun.com/github_31804537/article/details/54135821</link><guid>https://blog.youkuaiyun.com/github_31804537/article/details/54135821</guid><author>github_31804537</author><pubDate>Fri, 06 Jan 2017 11:14:03 +0800</pubDate><description><![CDATA[public class Solution {
    public int firstMissingPositive(int[] nums) {
        int count = 0;
        int start = 0;
        int end = nums.length - 1;
        // 这个把负数放到了最后的位置，其实没有必要，管负数，遇到负数直接跳过也行]]></description><category></category></item></channel></rss>