u010125432的博客

import java.util.ArrayList;import java.util.Collections;import java.util.Comparator;import java.util.List;public class MedianSortedArrays{ public static double findMedianSortedArrays(int[...

public class PowerOfTwo{ public static boolean isPowerOfTwo(int n) { if (n < 1) { return false; } while (n % 2 == 0) {// 求余为0的话，说明是3的整数倍 n /= ...

public class Stock1{ public static int maxProfit(int prices[]) { int minprice = Integer.MAX_VALUE; // 最小的谷值 int maxprofit = 0; //最大的利润 for (int i = 0; i < pr...

//买卖股票的最佳时机 IIpublic class Stock{ // 方法1 public static int calculate(int prices[], int s) { if (s >= prices.length) return 0; int max = 0; for (i...

public class ContainsDuplicate{ public boolean containsDuplicate(int[] nums) { for (int i = 0; i < nums.length; i++) { for (int j = 0; j < i; j++) ...

public class ReverseStr { public void reverseString(char[] s) { int len = s.length; if (len == 0) return; for (int i = 0; i < len / 2; i++){ ...

判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。示例 1:输入: 121输出: true示例2:输入: -121输出: false解释: 从左向右读, 为 -121 。 从右向左读, 为 121- 。因此它不是一个回文数。示例 3:输入: 10输出: false解释: 从右向左读, 为 01 。因此它不是一个回文数。来源：...

/*** 树节点* @author Administrator**/public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; }}...

/*** 链表节点* @author Administrator**/public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } @Override public String toStri...

/*** 链表节点* @author Administrator**/public class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}public class LinkDelete { /**...

/*** 链表节点* @author Administrator**/public class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}public class LinkAdd { public ListNo...

import java.util.LinkedList;import java.util.Queue;/*** 树两点间最大距离* @author Administrator**/public class BinaryTreeTwoPointMaxDis { // 两点之间最大距离 int sum = 0; //树的最大深度等于当前节点深度 1 ...

public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }/*** 二叉树的最小深度* @author Administrator**/public class BinaryTre...

public class BigNumMultipy { public static String bigNumMultipy(String num1,String num2){ StringBuffer result = new StringBuffer(); int num1l = num1.leng...

public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }DFS（深度优先搜索）策略的示例时间复杂度：我们每个结点只访问一次，因此时间复杂度为 O(N)O(N)，其中 NN 是结点的数量。...

/*** 大数相加* @author Administrator**/public class BigNumAdd { public static String bigNumMultipy(String num1,String num2){ StringBuffer result = new StringBuffer(); ...