登录
|
注册
公司
标签
文章
搜索
字符串
热门公司
百度
微软
腾讯
华为
阿里巴巴
迅雷
热门职位
C语言工程师
研发工程师
测试工程师
所有
有回答
没回答
新题目
有最佳答案
排序
热度
·
时间
·
经典指数
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 ...
阅读题目
字符串
面试题
经典指数
1
0
1047
Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases. Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front. spoilers alert... click to show requirements for atoi. Requirements for atoi: The function first discards as many whitespace char ...
阅读题目
字符串
面试题
经典指数
1
0
1018
The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as a reflection of the speaker's personality. Such a preference is called "Kuchiguse" and is often exaggerated artistically in Anime and Manga. For example, the artificial sentence ending particle "nyan~" is often used as a stereotype for characters with a cat-like personality: Itai nyan~ (It hurts, nyan~) Ninjin wa iyada nyan~ (I hate carrots, nyan~) Now given a few lin ...
阅读题目
字符串
面试题
经典指数
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
0
969
Implement regular expression matching with support for'.'and'*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be: bool isMatch(const char *s, const char *p) Some examples: isMatch("aa","a") → false isMatch("aa","aa") → true isMatch("aaa","aa") → false isMatch("aa", "a*") → true isMatch("aa", ".*") → true isMatch("ab", ".*") → true isMatch("aab", "c*a*b") → tr ...
阅读题目
字符串
面试题
经典指数
0
0
954
Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. ...
阅读题目
字符串
面试题
经典指数
1
0
954
Implement wildcard pattern matching with support for'?'and'*'. '?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence). The matching should cover the entire input string (not partial). The function prototype should be: bool isMatch(const char *s, const char *p) Some examples: isMatch("aa","a") → false isMatch("aa","aa") → true isMatch("aaa","aa") → false isMatch("aa", "*") → true isMatch("aa", "a*") → true isMatch("ab", "?*") → true isMatch("aa ...
阅读题目
字符串
面试题
经典指数
0
0
930
Given two binary strings, return their sum (also a binary string). For example, a ="11" b ="1" Return"100". ...
阅读题目
字符串
面试题
经典指数
1
0
909
Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. ...
阅读题目
字符串
面试题
经典指数
1
0
895
Given an absolute path for a file (Unix-style), simplify it. For example, path ="/home/", =>"/home" path ="/a/./b/../../c/", =>"/c" click to show corner cases. Corner Cases: Did you consider the case where path ="/../"? In this case, you should return"/". Another corner case is the path might contain multiple slashes'/'together, such as"/home//foo/". In this case, you should ignore redundant slashes and return"/home/foo". ...
阅读题目
字符串
面试题
经典指数
<<
<
21
22
23
24
25
>
>>
242
题目数
1
贡献者
212
答案数
扫描后移动端查看
我也分享一个题目
相关标签
C语言工程师
百度
查找
复杂度
研发工程师
动态规划
微软
基础知识
腾讯
华为
同类标签
树
排序
数组
链表
复杂度
查找
栈
图
哈希
队列
微信公众号
欢迎加入,一起群聊
×
登录
注册
找回密码
记住登录
登录
快速注册
直接第三方登录