摘要：背景需求： 解决方法程序： package org.mem; import java.util.*; public class Test1 { public static void main(String[] args) { final Map<String,Moci> map = new Hash 阅读全文

摘要：概述 有一整数数组，所有数都重复了两次，只有两个数重复了一次，找出这两个数，要求空间复杂度为O(1)，时间复杂度O（n） 代码 阅读全文

摘要：概述 Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You ha 阅读全文

摘要：描述 Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same rep 阅读全文

摘要：描述 Given an array S of n integers, find three integers in S such that the sum is closest toa given number, target. Return the sum of the three integer 阅读全文

摘要：概述 快速的升序排列（注意边界） 代码 阅读全文

摘要：概述 合并的升序排列 代码 阅读全文

摘要：概述 冒泡升序排列 代码 阅读全文

摘要：概述 选择的升序排列 代码 阅读全文

摘要：概述 递增方式插入排序 代码 阅读全文

摘要：package com.lilei.geotools.app_geotools; import java.util.Random; public class MaxHeapSort { public static void main(String[] args) { int[] array = new int[10000000]; for (int i = 0; i 0; ... 阅读全文

摘要：描述 Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two en 阅读全文

摘要：描述 Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3 阅读全文

摘要：描述 Given n pairs of parentheses, write a function to generate all combinations of wellformed parentheses.For example, given n = 3, a solution set is:" 阅读全文