由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
JobHunting版 - A few glassdoor questions
相关主题
G家面经FB Internship 挂在电面第二轮
这道Amazon面试题什么意思?问一个system design的题,看看大家怎么想的。
Fresh CS PhD, MS 面经贡献几道CS电面题
攒人品, Amazon电面请问下那个查找包含给定字符的最短子串咋做?
如何用JAVA中的circular array of queue 解决Josephus problem? (转载)Find first non-repeating char怎么做?
面试题目求助?顶风上来问道题:一个很大char[], 如何in-place 删除重复元素
A家电面Minimum Window Substring
Bloomberg 面经Longest Valid Parentheses
相关话题的讨论汇总
话题: char话题: questions话题: glassdoor话题: queue话题: toupper
进入JobHunting版参与讨论
1 (共1页)
w****f
发帖数: 684
1
Looking glassdoor's microsoft questions, do not figure out the answers
for below questions.
Did some one know the answers?
Queue with circular array
What are skip lists?
using a mac function toLower(char c) to write a toUpper(char c) function
, without using any ascii code
What is a singleton?
l*****a
发帖数: 14598
2
you still have a long way to go.
Bless

function

【在 w****f 的大作中提到】
: Looking glassdoor's microsoft questions, do not figure out the answers
: for below questions.
: Did some one know the answers?
: Queue with circular array
: What are skip lists?
: using a mac function toLower(char c) to write a toUpper(char c) function
: , without using any ascii code
: What is a singleton?

w****f
发帖数: 684
3
Yes, but I am catching up...
I figured out skip list and singleton.
* Queue with circular array?
*using a mac function toLower(char c) to write a toUpper(char c)
function, without using any ascii code?
x*******6
发帖数: 262
4
char toUpper(char c){
int i = 'a'-'A';
if(Character.isLetter(c)){
if(c-toLower(c)==0)
return (char)(c+i);
else
return c;
}else
throw new IllegalArgumentException();
}
circular array做queue是指queue的rear可以在front之前,两者和maxSize,size有公
式,自己去推导下。
x*******6
发帖数: 262
5
上面有行应该是 return (char)(c-i); -_-|||
w****f
发帖数: 684
6
Thanks for response. I knew this solution, but question is without ASCII
code.

【在 x*******6 的大作中提到】
: char toUpper(char c){
: int i = 'a'-'A';
: if(Character.isLetter(c)){
: if(c-toLower(c)==0)
: return (char)(c+i);
: else
: return c;
: }else
: throw new IllegalArgumentException();
: }

x*******6
发帖数: 262
7
那咋整?建个map?
1 (共1页)
进入JobHunting版参与讨论
相关主题
Longest Valid Parentheses如何用JAVA中的circular array of queue 解决Josephus problem? (转载)
ebay电面面经,攒人品,求好运面试题目求助?
面试的时候用到Trie,要求实现吗?A家电面
如何实现read/write 任意 size using circular bufferBloomberg 面经
G家面经FB Internship 挂在电面第二轮
这道Amazon面试题什么意思?问一个system design的题,看看大家怎么想的。
Fresh CS PhD, MS 面经贡献几道CS电面题
攒人品, Amazon电面请问下那个查找包含给定字符的最短子串咋做?
相关话题的讨论汇总
话题: char话题: questions话题: glassdoor话题: queue话题: toupper