分享一个周一谷歌电面

ohmystill 发表于 2016-5-22 07:35
但是伦敦是个好地方啊
amazon在英国有分部呀

only amazon, Microsoft(most positions are for experienced machine learning guys), Google, Facebook(no position for fresh (post)graduates), BB ........
almost nowhere to gain interview experience...

tianf 发表于 2016-5-18 09:39
请问第一题的方法是两步就可以完成吗？没怎么看懂，我想到是用两个变量保存前8位和后24位，然后两个变量或

第一题其实也不需要变量吧，用0xFF提取出来再位移就好了。

#include <cassert>

int change(int color) {
    int r = color & 0xFF000000;
    int g = color & 0x00FF0000;
    int b = color & 0x0000FF00;
    int a = color & 0x000000FF;
    return r >> 16 | g << 8 | b << 8 | a;
}

int changeV2(int color) {
    return (color & 0xFF000000) >> 16 | (color & 0x00FF0000) << 8 | (color & 0x0000FF00) << 8 | (color & 0x000000FF);
}

int main() {
    int color = 0x01020304;
    assert(change(color) == 0x02030104);
    assert(change(color) == changeV2(color));
    color = 0x0502010A;
    assert(change(color) == 0x0201050A);
    assert(change(color) == changeV2(color));
    return 0;
}

Altynai 发表于 2016-5-22 21:38
第一题其实也不需要变量吧，用0xFF提取出来再位移就好了。

#include

That's similar to what I did. int r = (color >>> 24) & 0xFF;