2018年11月3日
125. Valid Palindrome
摘要： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Note: For the purpose of this problem, w 阅读全文
posted @ 2018-11-03 12:00 bernieloveslife 阅读(111) 评论(0) 推荐(0)
33. Search in Rotated Sorted Array
摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Y 阅读全文
posted @ 2018-11-03 12:00 bernieloveslife 阅读(86) 评论(0) 推荐(0)
29. Divide Two Integers
摘要： Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after dividi 阅读全文
posted @ 2018-11-03 12:00 bernieloveslife 阅读(116) 评论(0) 推荐(0)
409. Longest Palindrome
摘要： Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文
posted @ 2018-11-03 12:00 bernieloveslife 阅读(100) 评论(0) 推荐(0)
31. Next Permutation
摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2018-11-03 12:00 bernieloveslife 阅读(112) 评论(0) 推荐(0)