__Meng

摘要： Given an array of integers nums, write a method that returns the "pivot" index of this array. We define the pivot index as the index where the sum of 阅读全文

摘要： Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements. Your t 阅读全文

摘要： We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11). N 阅读全文

摘要： Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other wo 阅读全文

摘要： Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i, j, k) such that the distance between iand j equals 阅读全文

摘要： Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrenc 阅读全文

摘要： 输入一个递增排序数组的一个旋转，输出旋转数组的最小元素例如1,2,3,4,5的一个旋转可以为3,4,5,1,2把一个数组的最开始若干个元素搬到数组的末尾，称之为数组的旋转 输出旋转数组的最小元素 C++: java: 阅读全文

摘要： Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Note: 区间求和 C++(166ms): Java(150ms): 阅读全文

摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

摘要： 用两个栈来实现一个队列，完成队列的Push和Pop操作。 队列中的元素为int类型。 C++: Java: 阅读全文