Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng ...
分类:
其他好文 时间:
2016-06-25 22:55:43
阅读次数:
158
Give you an integer matrix (with row size n, column size m),find the longest increasing continuous subsequence in this matrix. (The definition of the ...
分类:
其他好文 时间:
2016-06-25 21:33:58
阅读次数:
149
Write a function to find the longest common prefix string amongst an array of strings 题目:找vector中最长公共前缀, 思路:模拟比较的过程,我们可以看到这些. 按照数组中的第一个字符串开始进行比较, 对第一个 ...
分类:
其他好文 时间:
2016-06-22 18:51:52
阅读次数:
150
题目链接https://leetcode.com/problems/longest-common-prefix/题目原文
Write a function to find the longest common prefix string amongst an array of strings.
题目翻译写个函数,找出一个字符串数组中所有字符串的最长公共前缀。
题目描述不清晰。。。补充几个例子,...
分类:
编程语言 时间:
2016-06-21 07:26:30
阅读次数:
159
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng ...
分类:
其他好文 时间:
2016-06-20 17:12:28
阅读次数:
138
问题:https://leetcode.com/problems/longest-palindromic-substring/ 给定一个字符串 S,求出 S 的最长回文子串 思路: 1. 回文:一个字符串从前和从后读一致。S = "ABBA" 从前读:ABBA,从后读:ABBA 2. 最简单的做法: ...
分类:
其他好文 时间:
2016-06-19 18:14:53
阅读次数:
132
题目: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthe ...
分类:
其他好文 时间:
2016-06-19 01:16:46
阅读次数:
158
1. 问题描述 Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the far ...
分类:
其他好文 时间:
2016-06-18 20:01:22
阅读次数:
324
一开始以为是点权然后一直不会写QAQ 读完题发现是边权... u到v的路径异或和=根到u的路径异或和 异或 根到v的路径异或和 拿个trie或者是线段树记录一下就好了 1 #include<cstdio> 2 #include<iostream> 3 #include<cstring> 4 #inc ...
分类:
其他好文 时间:
2016-06-18 16:43:32
阅读次数:
158
The minimum interval between the leading edges of the start bits of two consecutive characters sent by the terminal to the ICC shall be between 12 and ...
分类:
其他好文 时间:
2016-06-17 00:36:27
阅读次数:
230