xxxknight

**Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return [“0->2”,”4->5”,”7”].**题目比较easy直接上代码。解法较啰嗦。package array;import java.util.A

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.解题：虽然AC，但是感觉空间不符合题意。未完待续。。。。package hashtable;/* * Gi

Given an integer, write a function to determine if it is a power of two.题目属于easy。前两种解法是一个意思，很容易想到；第三种解法最好（没想到）。代码：package bitmanipulation;//Given an integer, write a function to determine if it is a po

题目： Given a singly linked list, determine if it is a palindrome.解法：package linkedlist;import java.util.Stack;//Given a singly linked list, determine if it is a palindrome.public class PalindromeLinked

题目：Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front element. empty

Given two strings s and t, write a function to determine if t is an anagram of s.For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false.Note: You may assume the s

题目： Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one dig