willshine19的专栏

[LintCode]2 Sumpublic class Solution { /* * @param numbers : An array of Integer * @param target : target = numbers[index1] + numbers[index2] * @return : [index1 + 1, index2 + 1]

[LintCode]Majority Number IIpublic class Solution { /** * @param nums: A list of integers * @return: The majority number that occurs more than 1/3 */ public int majorityNumber

[刷题]Sort ColorsVersion 1 思路简单 O(n)class Solution { /** * @param nums: A list of integer which is 0, 1 or 2 * @return: nothing */ public void sortColors(int[] nums) {

[LintCode]Best Time to Buy and Sell Stock IIIclass Solution { /** * @param prices: Given an integer array * @return: Maximum profit */ public int maxProfit(int[] prices) {

[刷题]Single Number IIVersion 1public class Solution { /** * @param A : An integer array * @return : An integer */ public int singleNumberII(int[] A) { // 2015-09-17 O(n)

[LintCode]Sort Colors IIclass Solution { /** * @param colors: A list of integer * @param k: An integer * @return: nothing */ public void sortColors2(int[] colors, int k)

[LintCode]Sort Letters by Casepublic class Solution { /** *@param chars: The letter array you should sort by Case *@return: void */ public void sortLetters(char[] chars) {

[LintCode]Fast PowerVersion 1 O(n) 超时class Solution { /* * @param a, b, n: 32bit integers * @return: An integer */ public int fastPower(int a, int b, int n) { // 201

[LintCode]O(1) Check Power of 2class Solution { /* * @param n: An integer * @return: True or false */ public boolean checkPowerOf2(int n) { // 2015-09-06 if (n

[LintCode]Maximum Subarray IIIpublic class Solution { /** * @param nums: A list of integers * @param k: An integer denote to find k non-overlapping subarrays * @return: An integer

[LintCode]3 Sumpublic class Solution { /** * @param numbers : Give an array numbers of n integer * @return : Find all unique triplets in the array which gives the sum of zero. */

[LintCode]Trailing Zerosclass Solution { /* * param n: As desciption * return: An integer, denote the number of trailing zeros in n! */ public long trailingZeros(long n) {

[LintCode]Single Number IIIpublic class Solution { /** * @param A : An integer array * @return : An integer */ public int singleNumberII(int[] A) { // 2015-09-17 O(n) if

[LintCode]Majority Number IIIpublic class Solution { /** * @param nums: A list of integers * @param k: As described * @return: The majority number */ public int majorityN

[LintCode]Subarray Sum ClosestVersion 1 O(n^2) 超时public class Solution { /** * @param nums: A list of integers * @return: A list of integers includes the index of the first number

[LintCode]Maximum Subarraypublic class Solution { /** * @param nums: A list of integers * @return: A integer indicate the sum of max subarray */ public int maxSubArray(ArrayLi

[LintCode]Majority Numberpublic class Solution { /** * @param nums: a list of integers * @return: find a majority number */ public int majorityNumber(ArrayList nums) {

[LintCode]Single Numberpublic class Solution { /** *@param A : an integer array *return : a integer  */ public int singleNumber(int[] A) { // 2015-09-06 异或 if (A.length == 0) {

[LintCode]Subarray SumVersion 1public class Solution { /** * @param nums: A list of integers * @return: A list of integers includes the index of the first number * and

[LintCode]Sqrt(x)class Solution { /** * @param x: An integer * @return: The sqrt of x */ public int sqrt(int x) { // 2015-09-06 用int会溢出 long start = 0;

[LintCode]Best Time to Buy and Sell Stock IIclass Solution { /** * @param prices: Given an integer array * @return: Maximum profit */ public int maxProfit(int[] prices) {

[LintCode]Minimum Subarraypublic class Solution { /** * @param nums: a list of integers * @return: A integer indicate the sum of minimum subarray */ public int minSubArray(Arr

[LintCode]Partition Arraypublic class Solution { /** *@param nums: The integer array you should partition *@param k: As description *return: The index after partition */ pu

[刷题]Best Time to Buy and Sell Stock Show result public class Solution { /** * @param prices: Given an integer array * @return: Maximum profit */ public int maxProfit(int[] pri