Panda~的专栏

Single Number  Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implemen

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { publi

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { publi

public class Solution { public int maxProfit(int[] prices) { int profit = 0; if(null == prices || prices.length < 1) return profit; for(int i=0; i<prices.length

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { publi

public class Solution { public int maxProfit(int[] prices) { int profit = 0; if (null == prices || prices.length == 0) return profit; int hold = prices[0];

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { publi

public class Solution { public int reverse(int x) { int result = 0; int temp = Math.abs(x); while(temp != 0){ result =result * 10 + temp % 10; temp

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { publi

public class Solution { public int singleNumber(int[] A) { int result = 0; for(int i=0; i<A.length; i++){ result = result ^ A[i]; } return result; }

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { priva