<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[coobj2008的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/coobj2008</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; coobj2008]]></copyright><item><title><![CDATA[栈增长方向与大端/小端问题]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/38711571</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/38711571</guid><author>coobj2008</author><pubDate>Wed, 20 Aug 2014 20:28:02 +0800</pubDate><description><![CDATA[转载地址：http://www.cnblogs.com/xkfz007/archive/2012/06/22/2558935.html]]></description><category></category></item><item><title><![CDATA[浅谈C/C++的浮点数在内存中的存储方式]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/38684149</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/38684149</guid><author>coobj2008</author><pubDate>Tue, 19 Aug 2014 16:35:33 +0800</pubDate><description><![CDATA[原文地址：
                                                           C/C++浮点数在内存中的存储方式
       任何数据在内存中都是以二进制的形式存储的，例如一个short型数据1156，其二进制表示形式为00000100 10000100。则在Intel CPU架构的系统中，存放方式为  10000100(低地址单元) 00]]></description><category></category></item><item><title><![CDATA[Linux下二进制文件的查看和编辑]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/37663069</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/37663069</guid><author>coobj2008</author><pubDate>Thu, 10 Jul 2014 20:04:53 +0800</pubDate><description><![CDATA[http://blog.youkuaiyun.com/hansel/article/details/5097262]]></description><category></category></item><item><title><![CDATA[SSH不输入密码连接远程Linux主机]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/34847217</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/34847217</guid><author>coobj2008</author><pubDate>Thu, 26 Jun 2014 14:57:05 +0800</pubDate><description><![CDATA[原文地址：http://blog.chinaunix.net/uid-25266990-id-2600515.html]]></description><category></category></item><item><title><![CDATA[升级Ubuntu 12.04下的gcc到4.7]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/34806517</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/34806517</guid><author>coobj2008</author><pubDate>Thu, 26 Jun 2014 10:03:32 +0800</pubDate><description><![CDATA[原文地址：http://blog.chinaunix.net/uid-23381466-id-3475968.html]]></description><category></category></item><item><title><![CDATA[LeetCode Sudoku Solver]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/29193965</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/29193965</guid><author>coobj2008</author><pubDate>Sat, 07 Jun 2014 15:01:49 +0800</pubDate><description><![CDATA[题目：


Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells are indicated by the character '.'.

You may assume that there will be only one unique solution.



]]></description><category></category></item><item><title><![CDATA[LeetCode Next Permutation]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/29180161</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/29180161</guid><author>coobj2008</author><pubDate>Sat, 07 Jun 2014 10:55:14 +0800</pubDate><description><![CDATA[题目：


Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest]]></description><category></category></item><item><title><![CDATA[LeetCode Binary Tree Maximum Path Sum]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/28467859</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/28467859</guid><author>coobj2008</author><pubDate>Wed, 04 Jun 2014 22:16:46 +0800</pubDate><description><![CDATA[题目：


Given a binary tree, find the maximum path sum.

The path may start and end at any node in the tree.

For example:
Given the below binary tree,
       1
      / \
     2   3




Ret]]></description><category></category></item><item><title><![CDATA[LeetCode Trapping Rain Water]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/28449655</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/28449655</guid><author>coobj2008</author><pubDate>Wed, 04 Jun 2014 20:49:14 +0800</pubDate><description><![CDATA[题目：


Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

For example, 
Given [0,1,0,2,1,0,1,3]]></description><category></category></item><item><title><![CDATA[LeetCode Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/28429667</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/28429667</guid><author>coobj2008</author><pubDate>Wed, 04 Jun 2014 16:52:15 +0800</pubDate><description><![CDATA[题目：


Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).

The matching shoul]]></description><category></category></item><item><title><![CDATA[LeetCode Decode Ways]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/28128715</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/28128715</guid><author>coobj2008</author><pubDate>Mon, 02 Jun 2014 20:43:09 +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]]></description><category></category></item><item><title><![CDATA[LeetCode Valid Number]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/28114555</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/28114555</guid><author>coobj2008</author><pubDate>Mon, 02 Jun 2014 17:27:42 +0800</pubDate><description><![CDATA[题目：


Validate if a given string is numeric.

Some examples:
"0" => true
" 0.1 " => true
"abc" => false
"1 a" => false
"2e10" => true


Note: It is intended for the problem statement to b]]></description><category></category></item><item><title><![CDATA[LeetCode Text Justification]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/28099083</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/28099083</guid><author>coobj2008</author><pubDate>Mon, 02 Jun 2014 11:54:29 +0800</pubDate><description><![CDATA[题目：


Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.

You should pack your words in a greedy approac]]></description><category></category></item><item><title><![CDATA[LeetCode Interleaving String]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/27970459</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/27970459</guid><author>coobj2008</author><pubDate>Sun, 01 Jun 2014 15:43:43 +0800</pubDate><description><![CDATA[题目：


Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.

For example,
Given:
s1 = "aabcc",
s2 = "dbbca",

When s3 = "aadbbcbcac", return true.
When s3 = "aadbbba]]></description><category></category></item><item><title><![CDATA[LeetCode Candy]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/27959193</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/27959193</guid><author>coobj2008</author><pubDate>Sun, 01 Jun 2014 10:57:40 +0800</pubDate><description><![CDATA[题目：


There are N children standing in a line. Each child is assigned a rating value.

You are giving candies to these children subjected to the following requirements:

Each child must have at]]></description><category></category></item><item><title><![CDATA[LeetCode Substring with Concatenation of All Words]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/27802087</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/27802087</guid><author>coobj2008</author><pubDate>Sat, 31 May 2014 15:49:47 +0800</pubDate><description><![CDATA[题目：


You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and w]]></description><category></category></item><item><title><![CDATA[LeetCode String to Integer (atoi)]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/27580341</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/27580341</guid><author>coobj2008</author><pubDate>Thu, 29 May 2014 22:16:16 +0800</pubDate><description><![CDATA[题目：


Implement atoi to convert a string to an integer.

Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible]]></description><category></category></item><item><title><![CDATA[LeetCode Regular Expression Matching]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/27569741</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/27569741</guid><author>coobj2008</author><pubDate>Thu, 29 May 2014 21:20:56 +0800</pubDate><description><![CDATA[题目：


Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire]]></description><category></category></item><item><title><![CDATA[LeetCode Reverse Nodes in k-Group]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/27549271</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/27549271</guid><author>coobj2008</author><pubDate>Thu, 29 May 2014 17:15:30 +0800</pubDate><description><![CDATA[题目：


Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain]]></description><category></category></item><item><title><![CDATA[LeetCode Letter Combinations of a Phone Number]]></title><link>https://blog.youkuaiyun.com/coobj2008/article/details/27517489</link><guid>https://blog.youkuaiyun.com/coobj2008/article/details/27517489</guid><author>coobj2008</author><pubDate>Thu, 29 May 2014 12:07:26 +0800</pubDate><description><![CDATA[题目：


Given a digit string, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below.


Input]]></description><category></category></item></channel></rss>