abc_begin

摘要： 125. Valid Palindrome【easy】 Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, 阅读全文

摘要： 459. Repeated Substring Pattern【easy】 Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copie 阅读全文

摘要： 2. Trailing Zeros【easy】 Write an algorithm which computes the number of trailing zeros in n factorial. Have you met this question in a real interview? 阅读全文

摘要： 142. O(1) Check Power of 2【easy】 Using O(1) time to check whether an integer n is a power of 2. Have you met this question in a real interview? Yes Ex 阅读全文

摘要： 181. Flip Bits【easy】 Determine the number of bits required to flip if you want to convert integer n to integer m. Notice Both n and m are 32-bit integ 阅读全文

摘要： 183.Wood Cut【hard】 Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than 阅读全文

摘要： 61. Search for a Range【medium】 Given a sorted array of n integers, find the starting and ending position of a given target value. If the target is not 阅读全文

摘要： 62. Search in Rotated Sorted Array【medium】 Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might becom 阅读全文

摘要： 74. First Bad Version 【medium】 The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it 阅读全文

摘要： 75. Find Peak Element 【medium】 There is an integer array which has the following features: The numbers in adjacent positions are different. A[0] < A[1 阅读全文