Kagura_std的专栏

public int majorityNumber(int[] A){ if (A == null || A.length == 0) { return -1; } int candidate = 0; int count = 0; for (int i = 0; i < A.length; i++) { if

Given an array with positive and negative integers. Resort the array so that

Given a string which contains only letters. Sort it by lower case first and upper case second.NoteIt's not necessary to keep the original order of lower-case letters and upper case letters.

Given an array "nums" of integers and an int "k", Partition the array (i.e move the elements in "nums") such that,    * All elements     * All elements >= k are moved to the rightReturn th

Given an array of integers and a number k, the majority number is the number that occursmore than 1/k of the size of the array. Find it.NoteThere is only one majority number in the array.

Reverse a linked list. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL,return 5->4->3->2->1->NULL.

public static ArrayList fibonacci(int num) { ArrayList res = new ArrayList(); if (num == 0) { return res; } int first = 0; int second = 1; if (num == 1) { res

public String rotateString(String A, int k) { if (A == null || k == 0) { return A; } k = k % A.length(); String result = new String(); result = A.substring(A.lengt

Insert a integer as a ListNode to a sorted linked list.

Given two binary trees, check if the first tree is subtree of the second one. A subtree of a tree T is a tree S consisting of a node in T and all of its descendants in T. The subtree corresponding to

public static String deleteDuplicate(String A) { if (A == null || A.length() <= 1) { return A; } char str[] = A.toCharArray(); LinkedHashSet hs = new LinkedHashSet(

Count the number of 1’s in the binary expression of a given integerExample: input: 90

public char firstAppear(String A, String B) { char res = '\0'; if (A == null || B == null) { return res; } for (int i = 0; i < A.length(); i++) { for (int j = 0;

存两个变量。

public int majorityNumber2(int[] A){ if (A == null || A.length == 0) { return -1; } int candidate1 = 0; int candidate2 = 0; int count1 = 0; int count2 = 0;

Given an array of integers. Find a peak element in it. An array element is peak if it is NOT smaller than its neighbors. For corner elements, we need to consider only one neighbor. For example, for in