<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Coding]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/kpskylonely</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; kpskylonely]]></copyright><item><title><![CDATA[【18】Sort a stack in ascending order]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8962709</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8962709</guid><author>kpskylonely</author><pubDate>Wed, 22 May 2013 22:15:53 +0800</pubDate><description><![CDATA[Question: Write a program to sort a stack in ascending order. You should not make any assumptions about how the stack is implemented. The following are the
 only functions that should be used to writ]]></description><category></category></item><item><title><![CDATA[【17】Implement a MyQueue class which implements a queue using two stacks]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8962701</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8962701</guid><author>kpskylonely</author><pubDate>Wed, 22 May 2013 22:13:29 +0800</pubDate><description><![CDATA[Question:Implement a MyQueue class which implements a queue using two stacks
package CareerCup;

public class MyQueue 
{
	private Stack s1;
	private Stack s2;
	public MyQueue(){}
	
	public void enque]]></description><category></category></item><item><title><![CDATA[【16】Set of stacks]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8871831</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8871831</guid><author>kpskylonely</author><pubDate>Wed, 01 May 2013 13:21:11 +0800</pubDate><description><![CDATA[Qustion:Imagine a (literal) stack of plates. If the stack gets too high, it might topple. There-fore, in real life, we would likely start a new stack when the
 previous stack exceedssome threshold. I]]></description><category></category></item><item><title><![CDATA[【15】Design a stack which has push pop min max]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8869224</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8869224</guid><author>kpskylonely</author><pubDate>Tue, 30 Apr 2013 11:38:15 +0800</pubDate><description><![CDATA[Question:How would you design a stack which, in addition to push and pop, also has  functions which return the minimum and maximum elements? Push, pop, min,
 max should all operate inO(1) time. 
思路：]]></description><category></category></item><item><title><![CDATA[Java 实现堆栈和队列]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8861248</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8861248</guid><author>kpskylonely</author><pubDate>Sat, 27 Apr 2013 22:39:17 +0800</pubDate><description><![CDATA[1.堆栈
package CareerCup;

public class Stack 
{
	Node top;
	public Stack(){}
	
	public void push(int data)
	{
		Node node = new Node(data);
		node.next = top;
		top = node;
	}
	
	public Node pop()
	{]]></description><category></category></item><item><title><![CDATA[【14】Use a single array to implement three stacks]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8861236</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8861236</guid><author>kpskylonely</author><pubDate>Sat, 27 Apr 2013 22:37:17 +0800</pubDate><description><![CDATA[Question:Describe how you could use a single array to implement three stacks.
   
package CareerCup;

public class OneArrayThreeStack 
{
	int[] array;
	int top1;
	int top2;
	int top3Left;
	int top3R]]></description><category></category></item><item><title><![CDATA[【13】Find the start of loop]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8841839</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8841839</guid><author>kpskylonely</author><pubDate>Tue, 23 Apr 2013 21:59:36 +0800</pubDate><description><![CDATA[Question:Given a circular linked list, implement an algorithm which returns node at the beginning of the loop.
DEFINITION:Circular linked list: A (corrupt) linked list in which a node’s next pointer]]></description><category></category></item><item><title><![CDATA[【12】Adds two numbers represented by a linked list and returns the sum as a linked list]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8806525</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8806525</guid><author>kpskylonely</author><pubDate>Mon, 15 Apr 2013 23:14:28 +0800</pubDate><description><![CDATA[Question:You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the
 1’s digit is at the head of the list. Write]]></description><category></category></item><item><title><![CDATA[【11】Delete a node in the middle of a single linked list]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8806507</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8806507</guid><author>kpskylonely</author><pubDate>Mon, 15 Apr 2013 23:11:12 +0800</pubDate><description><![CDATA[Question:Implement an algorithm to delete a node in the middle of a single linked list, given only
 access to that node.EXAMPLE Input: the node ‘c’ from the linked list a->b->c->d->e 
package Career]]></description><category></category></item><item><title><![CDATA[【10】Find nth to last element of a singly linked list]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8797699</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8797699</guid><author>kpskylonely</author><pubDate>Sat, 13 Apr 2013 18:37:19 +0800</pubDate><description><![CDATA[Question:Implement an algorithm to find the nth to last element of a singly linked list.    

package CareerCup;

public class FindNthToLast
{
	public FindNthToLast(){}
	public Node find(LinkedList]]></description><category></category></item><item><title><![CDATA[Java 链表实现]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8797599</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8797599</guid><author>kpskylonely</author><pubDate>Sat, 13 Apr 2013 17:55:57 +0800</pubDate><description><![CDATA[先定义节点：

package CareerCup;

public class Node
{
	public Node next = null;
	public int data = 0;
	
	public Node(){}
	
	public Node(int data)
	{
		this.data = data;
		this.next = null;
	}
	
	public vo]]></description><category></category></item><item><title><![CDATA[【9】Delete duplicates from an unsorted linked list]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8797596</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8797596</guid><author>kpskylonely</author><pubDate>Sat, 13 Apr 2013 17:53:25 +0800</pubDate><description><![CDATA[Question: Write code to remove duplicates from an unsorted linked list. How would you solve this problem if a temporary buffer is not allowed?

package CareerCup;

import java.util.HashSet;

public]]></description><category></category></item><item><title><![CDATA[【8】set matrix's elements to 0]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8797052</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8797052</guid><author>kpskylonely</author><pubDate>Sat, 13 Apr 2013 15:21:33 +0800</pubDate><description><![CDATA[Question:Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column is set to 0.
package CareerCup;

public class setZero 
{
	public setZero(){}
	public int[][] set(i]]></description><category></category></item><item><title><![CDATA[【7】Rotate matrix by 90 degrees]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8797045</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8797045</guid><author>kpskylonely</author><pubDate>Sat, 13 Apr 2013 15:18:48 +0800</pubDate><description><![CDATA[Question:Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do
 this in place?
package CareerCup;

publi]]></description><category></category></item><item><title><![CDATA[【6】Decide if one string is a rotation of another string or not]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8785713</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8785713</guid><author>kpskylonely</author><pubDate>Wed, 10 Apr 2013 22:38:28 +0800</pubDate><description><![CDATA[Question: Assume you have a method isSubstring which checks if one word is a substring ofanother. Given two strings, s1 and s2, write code to check if s2 is
 a rotation of s1 usingonly one call to is]]></description><category></category></item><item><title><![CDATA[【5】Replace all spaces in a string with ‘%20’]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8785535</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8785535</guid><author>kpskylonely</author><pubDate>Wed, 10 Apr 2013 22:13:21 +0800</pubDate><description><![CDATA[Question:Write a method to replace all spaces in a string with ‘%20’. 
package CareerCup;

public class ReplaceSpace 
{
	public ReplaceSpace(){}
	public String replace(String str)
	{
		String strRepl]]></description><category></category></item><item><title><![CDATA[【4】Decide if two strings are anagrams or not]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8785521</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8785521</guid><author>kpskylonely</author><pubDate>Wed, 10 Apr 2013 22:09:25 +0800</pubDate><description><![CDATA[Question: Write a method to decide if two strings are anagrams or not.
package CareerCup;

public class Anagram 
{
	public Anagram(){}
	public boolean detect(String str1, String str2)
	{
		if(str1.le]]></description><category></category></item><item><title><![CDATA[【3】Remove the duplicate characters in a string]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8780139</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8780139</guid><author>kpskylonely</author><pubDate>Tue, 09 Apr 2013 21:47:54 +0800</pubDate><description><![CDATA[Question: Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two additional
 variables are fine An extra copy of the a]]></description><category></category></item><item><title><![CDATA[【2】Reverse a C-Style String]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8780120</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8780120</guid><author>kpskylonely</author><pubDate>Tue, 09 Apr 2013 21:44:22 +0800</pubDate><description><![CDATA[Question: Write code to reverse a C-Style String (C-String means that “abcd” is represented as five characters, including
 the null character )
package CareerCup;

public class ReverseCStyleStr 
{]]></description><category></category></item><item><title><![CDATA[【1】Detect if a string has all unique characters]]></title><link>https://blog.youkuaiyun.com/kpskylonely/article/details/8780089</link><guid>https://blog.youkuaiyun.com/kpskylonely/article/details/8780089</guid><author>kpskylonely</author><pubDate>Tue, 09 Apr 2013 21:40:39 +0800</pubDate><description><![CDATA[Question: Implement an algorithm to determine if a string has all unique characters. What if you can not use additional
 data structures?package CareerCup;

public class UniqueChar 
{
	public UniqueC]]></description><category></category></item></channel></rss>