摘要：
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted i 阅读全文
posted @ 2017-06-11 07:35
阿宝果果
阅读(106)
评论(0)
推荐(0)
摘要：
Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return: public class Solution { pu 阅读全文
posted @ 2017-05-15 01:42
阿宝果果
阅读(134)
评论(0)
推荐(0)
摘要：
Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be 阅读全文
posted @ 2017-05-14 22:36
阿宝果果
阅读(302)
评论(0)
推荐(0)
摘要：
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Example: public class Sol 阅读全文
posted @ 2017-05-12 14:39
阿宝果果
阅读(108)
评论(0)
推荐(0)
摘要：
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng 阅读全文
posted @ 2017-05-12 14:07
阿宝果果
阅读(91)
评论(0)
推荐(0)
摘要：
Write a function to find the longest common prefix string amongst an array of strings. public class Solution { public String longestCommonPrefix(Strin 阅读全文
posted @ 2017-05-12 13:03
阿宝果果
阅读(105)
评论(0)
推荐(0)
摘要：
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: if (s.length() == 0) { r 阅读全文
posted @ 2017-05-10 16:06
阿宝果果
阅读(112)
评论(0)
推荐(0)
摘要：
You are given a string representing an attendance record for a student. The record only contains the following three characters: A student could be re 阅读全文
posted @ 2017-05-03 13:54
阿宝果果
阅读(150)
评论(0)
推荐(0)
只有注册用户登录后才能阅读该文。 阅读全文
posted @ 2017-05-03 13:42
阿宝果果
阅读(1)
评论(0)
推荐(0)
浙公网安备 33010602011771号