<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Crystal_Zero的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Crystal_Zero</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Crystal_Zero]]></copyright><item><title><![CDATA[linux基础小计]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/80739175</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/80739175</guid><author>Crystal_Zero</author><pubDate>Tue, 19 Jun 2018 21:48:43 +0800</pubDate><description><![CDATA[1. 文件目录常见命令

ls      -ahl （所有文件包括隐藏，列表方式详细信息，人性化方式） 
        ls 通配符筛选 
pwd     查看当前所在文件夹 
touch   如果文件不存在，创建文件，若存在，更新文件时间 
mkdir   -p a/b/c递归创建目录 
rm      -f 强制，-r 递归 
tree        树形图列出目录结构，-d 只显示目录 
...]]></description><category></category></item><item><title><![CDATA[LaTeX论文写作的一些用法记录]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/79121474</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/79121474</guid><author>Crystal_Zero</author><pubDate>Sun, 21 Jan 2018 20:21:59 +0800</pubDate><description><![CDATA[latex
公式不编号： \nonumber 
常用宏包汇总
图片
基本用法
图片对齐
多图片排版
表格
三线表
表格对齐与列宽设置
复杂表格结构
multirow
multicolumn
改变表格行高
伪代码
一些间距调整
特殊符号
公式]]></description><category></category></item><item><title><![CDATA[使用uncompyle2 反编译pyo]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/78644878</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/78644878</guid><author>Crystal_Zero</author><pubDate>Mon, 27 Nov 2017 14:40:58 +0800</pubDate><description><![CDATA[github 地址: wibiti/uncompyle2安装 
     python setup.py install使用uncompyle2 ***.pyo > ***.py之前做外包也试过加密, 确实有一些加密工具,能通过替换变量名,让代码变得不可读. 但是不管怎样,终归没有完全安全的加密方式….]]></description><category></category></item><item><title><![CDATA[ubuntu重装的一些问题]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/78639417</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/78639417</guid><author>Crystal_Zero</author><pubDate>Sun, 26 Nov 2017 20:12:00 +0800</pubDate><description><![CDATA[分区1）语言选择英文，建议在Linux系统下一切都使用英文的； 
2）先不更新系统、先不安装第三方软件，直接过； 
3）选择Something else，把现有分区全部“减”成free space，重新分区如下（大小供参考）： 
/boot：200M，采用Logical Partition，用于efi （注意：如果是双硬盘双系统，可以考虑把该部分放在ssd，与win同一块ssd，否则还需挂载） 
s]]></description><category></category></item><item><title><![CDATA[将二叉搜索树转化为双向链表]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73514958</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73514958</guid><author>Crystal_Zero</author><pubDate>Tue, 20 Jun 2017 20:21:37 +0800</pubDate><description><![CDATA[输入一棵二叉搜索树，
将该二叉搜索树转换成一个排序的双向链表。
要求不能创建任何新的结点，只能调整树中结点指针的指向。创建的双向链表的顺序就是二叉搜索树的中序遍历结果。 
这里有递归和非递归解法。一般的非递归解法需要开辟额外的空间，本次借助Morris算法，给出一种不需要额外空间开销的非递归解法。 
首先是递归    TreeNode lastLeft = null;
    public Tree]]></description><category></category></item><item><title><![CDATA[复制含有随机节点的链表]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73505987</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73505987</guid><author>Crystal_Zero</author><pubDate>Tue, 20 Jun 2017 18:25:43 +0800</pubDate><description><![CDATA[输入一个复杂链表（每个节点中有节点值，以及两个指针，一个指向下一个节点，另一个特殊指针指向任意一个节点），返回结果为复制后复杂链表的head。（注意，输出结果中请不要返回参数中的节点引用，否则判题程序会直接返回空）由于是深copy，随机节点指向的对象也应该是新的节点。 
给出两种解法 
第一种，采用HashMap记录新旧节点 
代码如下：    public RandomListNode Clone]]></description><category></category></item><item><title><![CDATA[剑指offer 二叉树的后续遍历序列]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73502353</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73502353</guid><author>Crystal_Zero</author><pubDate>Tue, 20 Jun 2017 17:06:48 +0800</pubDate><description><![CDATA[输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。这题不难，今天想到一个比较好的递归的解法。public class Solution {
    public boolean VerifySquenceOfBST(int [] sequence) {
        if(sequence==null || s]]></description><category></category></item><item><title><![CDATA[剑指offer 数值的整数次方]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73481154</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73481154</guid><author>Crystal_Zero</author><pubDate>Tue, 20 Jun 2017 10:36:47 +0800</pubDate><description><![CDATA[给定一个double类型的浮点数base和int类型的整数exponent。求base的exponent次方。写出指数的二进制表达，例如13表达为二进制1101。 
举例:10^1101 = 10^0001*10^0100*10^1000。 
通过&1和>>1来逐位读取1101，为1时将该位代表的乘数累乘到最终结果。代码public class Solution {
    public doubl]]></description><category></category></item><item><title><![CDATA[Java API一些注意的零碎不定期整理]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73480077</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73480077</guid><author>Crystal_Zero</author><pubDate>Tue, 20 Jun 2017 09:03:26 +0800</pubDate><description><![CDATA[Arrays.binarySearch()
二分搜索是建立在有序数组上的，所以搜索前排序，否则得到的结果不可行。
指定from, to的时候，包括from，不包括to
如果查找到返回对应的位置，没有查找到返回第一个比他大的位置，值为负数，转换后为(-res -1） 
不管指定区间与否，3都成立。
将集合元素反序Collections.reverse()运行时间在线性范围，但是需要开辟额外的空间。]]></description><category></category></item><item><title><![CDATA[leetcode 91. Decode Ways]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73076654</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73076654</guid><author>Crystal_Zero</author><pubDate>Sun, 11 Jun 2017 23:41:16 +0800</pubDate><description><![CDATA[A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an encoded message containing digits, determine the total number of w]]></description><category></category></item><item><title><![CDATA[leetcode 523. Continuous Subarray Sum]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73075522</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73075522</guid><author>Crystal_Zero</author><pubDate>Sun, 11 Jun 2017 23:16:52 +0800</pubDate><description><![CDATA[Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up to n]]></description><category></category></item><item><title><![CDATA[leetcode 322. Coin Change]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73065049</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73065049</guid><author>Crystal_Zero</author><pubDate>Sun, 11 Jun 2017 20:27:07 +0800</pubDate><description><![CDATA[You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money c]]></description><category></category></item><item><title><![CDATA[leetcode 221. Maximal Square & 85. Maximal Rectangle]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73057056</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73057056</guid><author>Crystal_Zero</author><pubDate>Sun, 11 Jun 2017 17:51:47 +0800</pubDate><description><![CDATA[221. Maximal SquareGiven a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.For example, given the following matrix:1 0 1 0 0
1 0 1 1 1
1 1 1 1]]></description><category></category></item><item><title><![CDATA[leetcode 139. Word Break]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73039465</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73039465</guid><author>Crystal_Zero</author><pubDate>Sun, 11 Jun 2017 16:14:43 +0800</pubDate><description><![CDATA[Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assum]]></description><category></category></item><item><title><![CDATA[leetcode 63. Unique Paths II]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73011087</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73011087</guid><author>Crystal_Zero</author><pubDate>Sun, 11 Jun 2017 00:19:02 +0800</pubDate><description><![CDATA[Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.For ex]]></description><category></category></item><item><title><![CDATA[leetcode 264. Ugly Number II]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73010787</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73010787</guid><author>Crystal_Zero</author><pubDate>Sat, 10 Jun 2017 23:57:24 +0800</pubDate><description><![CDATA[Total Accepted: 56978
Total Submissions: 176871
Difficulty: Medium
Contributor: LeetCode
Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include]]></description><category></category></item><item><title><![CDATA[leetcode 120. Triangle]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73010615</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73010615</guid><author>Crystal_Zero</author><pubDate>Sat, 10 Jun 2017 23:25:43 +0800</pubDate><description><![CDATA[Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle
[
     [2],
    [3,4],
   [6,5,7],]]></description><category></category></item><item><title><![CDATA[leetcode 213. House Robber II]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73010087</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73010087</guid><author>Crystal_Zero</author><pubDate>Sat, 10 Jun 2017 23:04:59 +0800</pubDate><description><![CDATA[Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all]]></description><category></category></item><item><title><![CDATA[leetcode 376. Wiggle Subsequence]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73008197</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73008197</guid><author>Crystal_Zero</author><pubDate>Sat, 10 Jun 2017 21:17:08 +0800</pubDate><description><![CDATA[A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either posi]]></description><category></category></item><item><title><![CDATA[leetcode 374&375. Guess Number Higher or Lower]]></title><link>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73004478</link><guid>https://blog.youkuaiyun.com/Crystal_Zero/article/details/73004478</guid><author>Crystal_Zero</author><pubDate>Sat, 10 Jun 2017 19:40:21 +0800</pubDate><description><![CDATA[We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number is higher or lowe]]></description><category></category></item></channel></rss>