一亩三分地论坛

 找回密码
 Sign Up 注册获取更多干货
码农求职神器Triplebyte:
不用海投,内推多家公司面试
Airbnb 数据科学职位
in analytics and inference
游戏初创公司
招聘工程师、Designer和游戏策划
游戏初创公司DreamCraft招聘工程师、UIUX Designer和游戏策划
电商初创公司Good Days
招聘SDE/UI/TPM实习生
把贵司招聘信息放这里
查看: 1977|回复: 0
收起左侧

Hulu

[复制链接] |试试Instant~ |关注本帖
106 发表于 2015-5-23 11:57:26 | 显示全部楼层 |阅读模式

2015(1-3月) 码农类 硕士 全职@Hulu - 内推 - 技术电面 |Passfresh grad应届毕业生

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?Sign Up 注册获取更多干货

x
Hulu电面. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴
随便问一下我的实习经历, 讲了一分钟就直接coding了。 isAngram 两种方法及其变体。
// Ransom Note
// magazine = "cdhjkscjgcdjkshvfhjgdu..." "themet"
// note = "Meet me somewhere" "meet" a-z A-Z 0-9

boolean canMakeRansomNote(String magazine, String note) {
//assume the input is not null
Map<Character, Frequence> map = new HashMap<>();
for(int i = 0; i < note.length(); i++){
char c = note.charAt(i);
if(isValid(c)) //ignore any space or illegal chars{
int freq = map.containsKey(c) ? map.get(c)+1 : 1;
map.put(c, freq);
}
}

for(int i = 0; i < magazine.length(); i++){
char c = magazine.charAt(i);
if(isValid(c) && map.containsKey(c){ //care about the chars occured in notes.. 鍥磋鎴戜滑@1point 3 acres
int newFreq = map.get(c)-1; //found a char which is contained in notes
if(newFreq <= 0){
map.remove(c);
if(map.isEmpty())
return true;
}
else 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
map.put(c, newFreq);

. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
}

return false;
}
}

public boolean isValid(char c){ //c is Uni-8, int = 65 ('A')
if(c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' || c >= '0' && c <= '9')
return true;
. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷return false;
}

// "abc", "cab" -> true "[a, b , c] [a, b, c].鏈枃鍘熷垱鑷1point3acres璁哄潧
// "abc", "def" -> false
. 1point3acres.com/bbs
. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
void isAnagram(String string1, String string2) {. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
//first idea: sort them and then compare if it is equals
//assume input is not null
if(string1.length() != string2.length())
return false;

Map<Character, Integer> map = new HashMap<>();
//iterate string1 and store it in map
for(int i = 0; i < string1.length(); i++){
char c = string1.charAt(i);
int freq = map.containsKey(c) ? map.get(c)+1 : 1;
map.put(c, freq);
}

//iterate the other string to check
for(int i = 0; i < string2.length(); i++){
char c = string2.charAt(i);
if(!map.containsKey(c))
return false;
//decrease freq
int newFreq = map.get(c)-1;
if(newFreq < 0)
return false;

map.put(c, newFreq);
}

return true;
}

. Waral 鍗氬鏈夋洿澶氭枃绔,


void isAnagram(String string1, String string2) {.1point3acres缃
//first idea: sort them and then compare if it is equals
//assume input is not null
if(string1.length() != string2.length())
return false;

char[] S1 = string1.toCharArray();
char[] S2 = string2.toCharArray()

Arrays.sort(S1);.1point3acres缃
Arrays.sort(s2);

return isEqual(S1, S2); // Arrays.toStint(s1).equals(Arrays.toString(S2)); . from: 1point3acres.com/bbs
}

public boolean isEqual(char[] A, char[] B){
//cornet case
if(A == null && B == null)
return true;
. From 1point 3acres bbs
//only one of them is null
if(A == null || B == null)
returnf false;

for(int i = 0; i < A.length; i++){
if(A != B)
return false;
}

return true;
. from: 1point3acres.com/bbs }


评分

1

查看全部评分

本版积分规则

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明

custom counter

GMT+8, 2018-1-23 02:38

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表