登录
|
注册
公司
标签
文章
搜索
字符串
热门公司
百度
微软
腾讯
华为
阿里巴巴
迅雷
热门职位
C语言工程师
研发工程师
测试工程师
所有
有回答
没回答
新题目
有最佳答案
排序
热度
·
时间
·
经典指数
0
0
1419
remove掉给定字符串中的多余空格,要求达到以下要求 A.无连续相邻的两个空格 B.字符串开头和结尾无空格 C.新的一行开头和结尾无空格 ...
阅读题目
微软
字符串
问答题
经典指数
0
0
1399
字符串匹配实现, 请以两种方法,回溯与不回溯算法实现。 ...
阅读题目
微软
字符串
问答题
经典指数
0
0
1379
给定字符串S,找出其中第一个出现一次的字符,要求时间复杂度O(N)。 ...
阅读题目
字符串
查找
问答题
经典指数
0
0
1350
用代码实现以下功能,一个超长字符串表示的十进制数,转化为十六进制的字符串。 ...
阅读题目
腾讯
字符串
问答题
经典指数
0
0
1343
Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given "Is PAT&TAP symmetric?", the longest symmetric sub-string is "s PAT&TAP s", hence you must output 11. 输入描述: Each input file contains one test case which gives a non-empty string of length no more than 1000. 输出描述: For each test case, simply print the maximum length in a line. 输入例子: Is PAT&TAP symmetric? 输出例子: 11 ...
阅读题目
动态规划
字符串
面试题
经典指数
0
0
1222
Given two strings S1 and S2 , S = S1 - S2 is defined to be the remaining string after taking all the characters in S2 from S1 . Your task is simply to calculate S1 - S2 for any given strings. However, it might not be that simple to do it fast . 输入描述: Each input file contains one test case. Each case consists of two lines which gives S1 and S2, respectively. The string lengths of both strings are no more than 104. It is guaranteed that all the characters are visible ASCII codes and wh ...
阅读题目
字符串
面试题
经典指数
0
0
1196
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s ="aab", Return [ ["aa","b"], ["a","a","b"] ] ...
阅读题目
字符串
面试题
经典指数
0
0
1163
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1. ...
阅读题目
字符串
面试题
经典指数
0
0
1052
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces' 'when necessary so that each line has exactly L characters. Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line do not divide evenly between words, the empty slots on the left wi ...
阅读题目
字符串
面试题
经典指数
0
0
1016
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. ...
阅读题目
字符串
面试题
经典指数
1
2
3
4
32
题目数
1
贡献者
212
答案数
扫描后移动端查看
我也分享一个题目
相关标签
C语言工程师
百度
查找
复杂度
研发工程师
动态规划
微软
基础知识
腾讯
华为
同类标签
树
排序
数组
链表
复杂度
查找
栈
图
哈希
队列
微信公众号
欢迎加入,一起群聊
×
登录
注册
找回密码
记住登录
登录
快速注册
直接第三方登录