原创 CareerCup 14.6
Implement Circular Array /* * Career Cup 14.6 * */ package CareerCup; import java.util.Iterator; public class C
2020-02-23 20:56:46
原创 leetcode valid panlidrome
public class Solution { public boolean isPalindrome(String s) { // Start typing your Java solution below
2018-08-23 09:07:43
2
原创 leetcode edit distance
public int minDistance(String word1, String word2) { // int rowNum = word1.length(); int colNum
2018-08-23 09:07:43
原创 leetcode pow
public class Pow { // //recursive version // //stack overflow when n is large // public double pow(double x, int
2018-08-23 09:07:42
3
原创 leetcode plus one
public int[] plusOne(int[] digits) { if(digits.length < 1) return null; String ans = "";
2018-08-23 09:07:42
1
原创 leetcode Jump Game
/* Leetcode JumpGame Given an array of non-negative integers, you are initially positioned at the first index of the
2018-08-23 09:07:42
原创 leetcode maxSubArray
O(n) solution public class MaxSubArray { public int maxSubArray(int[] A) { int sum = 0, curr = 0; in
2018-08-23 09:07:42
原创 leetcode merge intervals
import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; class Interval { int start;
2018-08-23 09:07:42
原创 Java XML Read
http://blog.csdn.net/smcwwh/article/details/7183869 SAX: http://blog.csdn.net/lifaming15/article/details/1749695
2018-08-23 09:07:41
原创 leetcode merge two sorted list
public ListNode mergeTwoLists(ListNode l1, ListNode l2) { // Start typing your Java solution below
2018-08-23 09:07:41
原创 leetcode insert interval
Iterate the intervals list. Compare newInterval with each item in the list. If overlapping, update the item. Otherwise(
2018-08-23 09:07:41
3
原创 leetcode minimum path sum
DP Min[ i, j] = Min( Min[i - 1][j] + grid[i][j], Min[i][j - 1] + grid[ i ][ j ]); public int minPathSum(int[][] g
2018-08-23 09:07:41
3
原创 leetcode add binary
public String addBinary(String a, String b) { // char resi = '0'; int lena = a.length();
2018-08-23 09:07:41
5
原创 Leetcode Permutation II
Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1
2018-08-23 09:07:41