<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[samfang的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/samfang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; samfang]]></copyright><item><title><![CDATA[test]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/17011055</link><guid>https://blog.youkuaiyun.com/samfang/article/details/17011055</guid><author>samfang</author><pubDate>Thu, 28 Nov 2013 19:50:39 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[Debug Java applications remotely with Eclipse]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/16994199</link><guid>https://blog.youkuaiyun.com/samfang/article/details/16994199</guid><author>samfang</author><pubDate>Wed, 27 Nov 2013 22:19:43 +0800</pubDate><description><![CDATA[Debug Java applications remotely with Eclipse




http://www.ibm.com/developerworks/opensource/library/os-eclipse-javadebug/?ca=drs-tp5008]]></description><category></category></item><item><title><![CDATA[加拿大驾照路考要点（转贴）]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/11517595</link><guid>https://blog.youkuaiyun.com/samfang/article/details/11517595</guid><author>samfang</author><pubDate>Tue, 10 Sep 2013 09:52:12 +0800</pubDate><description><![CDATA[1.闯黄灯肯定FAIL
2.不查盲点肯定FAIL(包括换线, 拐弯时)
3.STOP SIGN 处的标准做法 
(一定要彻底停下来; 停的位置要标准, 一定要左右左察看后再离开)
4.拐弯时速度一定要减到15~20KM/H, 
拐弯处查盲点.
5.趴车时,无论是倒趴还是平行趴, 只要车是倒行, 一定要回头看. 不转身回头看的一律扣分.
6.如果四个方向都有STOP, 
谁先到谁先走]]></description><category></category></item><item><title><![CDATA[Longest Palindromic Substring (DP)]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9919105</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9919105</guid><author>samfang</author><pubDate>Mon, 12 Aug 2013 11:03:19 +0800</pubDate><description><![CDATA[Given a string S,
 find the longest palindromic substring in S.
 You may assume that the maximum length of S is
 1000, and there exists one unique longest palindromic substring.


public class S]]></description><category></category></item><item><title><![CDATA[Reverse Integer]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9864821</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9864821</guid><author>samfang</author><pubDate>Fri, 09 Aug 2013 21:26:21 +0800</pubDate><description><![CDATA[Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321
Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you]]></description><category></category></item><item><title><![CDATA[Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9849663</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9849663</guid><author>samfang</author><pubDate>Fri, 09 Aug 2013 09:33:47 +0800</pubDate><description><![CDATA[You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link]]></description><category></category></item><item><title><![CDATA[Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9848909</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9848909</guid><author>samfang</author><pubDate>Fri, 09 Aug 2013 06:44:31 +0800</pubDate><description><![CDATA[Given a string, find the length of the longest substring without repeating characters. For example, the
 longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo]]></description><category></category></item><item><title><![CDATA[Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9832087</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9832087</guid><author>samfang</author><pubDate>Thu, 08 Aug 2013 10:15:19 +0800</pubDate><description><![CDATA[import java.util.*;


public class Solution {
    public ArrayList> partition(String s) {
        // Start typing your Java solution below
        // DO NOT write main() function
        ArrayL]]></description><category></category></item><item><title><![CDATA[Median of Two Sorted Arrays (全数组扫描)]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9830069</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9830069</guid><author>samfang</author><pubDate>Thu, 08 Aug 2013 09:02:08 +0800</pubDate><description><![CDATA[public class Solution {


    public double findMedianSortedArrays(int A[], int B[]) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int alengt]]></description><category></category></item><item><title><![CDATA[median-of-two-sorted-arrays]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9815123</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9815123</guid><author>samfang</author><pubDate>Wed, 07 Aug 2013 11:50:10 +0800</pubDate><description><![CDATA[http://leetcode.com/2011/03/median-of-two-sorted-arrays.html#comment-1053



public class Solution {
    public double findMedianSortedArrays(int A[], int B[]) {
        // Start typing your Jav]]></description><category></category></item><item><title><![CDATA[Two Sum]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9787749</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9787749</guid><author>samfang</author><pubDate>Tue, 06 Aug 2013 10:41:56 +0800</pubDate><description><![CDATA[Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, whe]]></description><category></category></item><item><title><![CDATA[NAS SAMBA NFS]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/9125025</link><guid>https://blog.youkuaiyun.com/samfang/article/details/9125025</guid><author>samfang</author><pubDate>Wed, 19 Jun 2013 00:48:28 +0800</pubDate><description><![CDATA[http://answers.microsoft.com/en-us/windows/forum/windows_7-windows_programs/nfs-client-for-windows-7/42aae25d-d077-4ff9-abdf-7314a589c46dhttp://www.microsoft.com/en-us/download/details.aspx?id=2391htt]]></description><category></category></item><item><title><![CDATA[DLAN 连接和使用体验——Twonky]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8963672</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8963672</guid><author>samfang</author><pubDate>Thu, 23 May 2013 09:49:27 +0800</pubDate><description><![CDATA[DLAN 连接和使用体验——Twonky



松下说明书中讲到目前ST30C只支持与windows7 的DLAN连接，只好下载了windows7 系统，但是因为对windows7不甚了解，担心装机出现问题，故一直没有升级系统，昨天一不小心发现其实ST30C支持与xp系统的DLAN连接：
1 下载Twonkymeida server，google一下都能找到  http://www.on]]></description><category></category></item><item><title><![CDATA[Java Thread-safe]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8786165</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8786165</guid><author>samfang</author><pubDate>Thu, 11 Apr 2013 08:25:37 +0800</pubDate><description><![CDATA[http://javarevisited.blogspot.ca/2012/01/how-to-write-thread-safe-code-in-java.html

http://jcip.net.s3-website-us-east-1.amazonaws.com/listings.html


How to write Thread-Safe Code in Java]]></description><category></category></item><item><title><![CDATA[How to Rotate Tomcat catalina.out]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8694488</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8694488</guid><author>samfang</author><pubDate>Wed, 20 Mar 2013 01:16:15 +0800</pubDate><description><![CDATA[From: http://java.dzone.com/articles/how-rotate-tomcat-catalinaout



If catalina.out becomes 2GB in size, tomcat crashes and fails to start without any error message. To avoid this scenario you s]]></description><category></category></item><item><title><![CDATA[FW: 订北美酒店省钱的最佳选择：Priceline & Hotwire]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8606317</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8606317</guid><author>samfang</author><pubDate>Sun, 24 Feb 2013 01:28:52 +0800</pubDate><description><![CDATA[转：订北美酒店省钱的最佳选择：Priceline & Hotwire

Posted on January
 30, 2011 by gkp




原文地址：http://b.gkp.cc/2011/01/30/bid-hotel-room-with-priceline-and-hotwire/





什么是酒店拍卖？

如果你和我一样去过几次欧洲后偶尔去一次]]></description><category></category></item><item><title><![CDATA[DB Operation]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8582194</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8582194</guid><author>samfang</author><pubDate>Sat, 16 Feb 2013 09:30:21 +0800</pubDate><description><![CDATA[tnsnames.ora already copied to 4,4u and 4q under ${ORACLE_HOME}/network/admin.
export ORASERVER=***01


export ORACLE_HOME=/opt/oraClient/11.2.0.3
export SQLPLUS=$ORACLE_HOME/bin/sqlplus; export]]></description><category></category></item><item><title><![CDATA[春节菜单]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8554668</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8554668</guid><author>samfang</author><pubDate>Wed, 30 Jan 2013 08:24:11 +0800</pubDate><description><![CDATA[凉菜：
1. 凉拌黄瓜
2. 卤味拼盘（黄豆，牛腱，猪舌，鸭翅膀）
3. 盐水毛豆
4. 口水鸡


热菜：
1. 烤鱼（鱼，土豆，洋葱，香菜，芹菜）
2. 西式炖牛肉 (http://bbs.wenxuecity.com/beef/780496.html)
3. 西兰花
4.西芹炒肉丝
5.烤鸡翅
6.COSCO 烤肉/鱼, (另外备份一个)
7.熏鱼
8.南京盐水]]></description><category></category></item><item><title><![CDATA[债券逆回购 上海深圳市场 操作指南]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8442029</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8442029</guid><author>samfang</author><pubDate>Thu, 27 Dec 2012 09:55:47 +0800</pubDate><description><![CDATA[最小价格变动单位：0.005元；  最低参与金额：10万，之后以10万的整数倍增加；下单以“张”为单位，一张为100元，最低1000张（相当于10万）；T日下单，T+1资金可用，T+2资金可取。

   




 

    最小价格变动单位：0.01元，最低参与金额：1000元，之后以1000元的整数倍增加；下单以“张”为单位，最低10张（相当于1000元）；T日下单，T+1]]></description><category></category></item><item><title><![CDATA[债券正回购和逆回购交易操作指南]]></title><link>https://blog.youkuaiyun.com/samfang/article/details/8293722</link><guid>https://blog.youkuaiyun.com/samfang/article/details/8293722</guid><author>samfang</author><pubDate>Fri, 14 Dec 2012 10:19:09 +0800</pubDate><description><![CDATA[一、债券回购的含义 
　　债券质押式回购简单地说就是交易双方以债券为质押品的一种短期资金借贷行为。其中债券持有人(正回购方)将债券质押而获得资金使用权，到约定的时间还本并支付一定的利息，从而“赎回”债券。而资金持有人(逆回购方)就是正回购方的交易对手。在实际交易中债券是质押给了第三方即中国结算公司，这样交易双方更加安全、便捷。



　　　　二、可回购的债券

　　　　所有的国债、绝]]></description><category></category></item></channel></rss>