原创 二叉樹基本操作
package java_study.JianZhiOffer; /** * Created by ethan on 2015/6/21. */ public class TreeNode { char value;
原创 Pascal's Triangle
public class Solution { public List<List<Integer>> generate(int numRows) { List<List<Integer>> ans = new
原创 Regular Expression Matching
// 用c/c++代碼會簡潔並且效率高很多。直接使用c/c++中的字符數組char*做代碼會簡潔很多 package leetcode.xuyi; import org.junit.Test; /** * Created by et
原创 java實現七種排序 (插入排序, 希爾排序, 插入排序, 快速排序, 簡單選擇排序, 堆排序, 歸併排序)
package java_study.sort; import org.junit.Test; import java.util.Random; /** * Created by ethan on 2015/6/20. */ p
原创 從尾到頭打印鏈表
package java_study.JianZhiOffer; import org.junit.Test; import java.util.Random; import java.util.Stack; /** * Crea
原创 ZigZag Conversion
public class Solution { public String convert(String s, int nRows) { int len = s.length(); if (le
原创 Longest Palindromic Substring
package leetcode.xuyi; import org.junit.Test; /** * Created by ethan on 2015/5/7. */ public class LongestPalindro
原创 Container With Most Water
public class Solution { public int maxArea(int[] height) { int max = 0; int left = 0; int r
原创 Palindrome Number
package leetcode.xuyi; import org.junit.Test; /** * Created by ethan on 2015/5/13. */ public class PalindromeNumber
原创 Longest Common Prefix
public class Solution { public String longestCommonPrefix(String[] strs) { if (strs == null) return "";
原创 兩個棧實現一個隊列
package java_study.JianZhiOffer; import java.util.Stack; /** * Created by ethan on 2015/6/22. */ public class No7Qu
原创 Reverse Integer
package leetcode.xuyi; import org.junit.Test; /** * Created by ethan on 2015/5/9. */ public class ReverseInteger {
原创 斐波那契數列的遞歸實現和非遞歸實現
package java_study.JianZhiOffer; import org.junit.Test; /** * Created by ethan on 2015/6/23. * No9 斐波那契數列的遞歸實現和非遞歸實
原创 劍指offer第三題:二維數組中查找
package java_study.JianZhiOffer; import java_study.sort.Sort7; import org.junit.Test; import java.util.Arrays; import
原创 旋轉數組查找, 二分查找的遞歸於非遞歸實現
package java_study.JianZhiOffer; import org.junit.Test; import java.util.Arrays; /** * Created by ethan on 2015/6/2