面试题1

2006-08-16 10:51:52 1.2k 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

微积分，用编程理解高数（python，C，C++）很好理解，导数中，x是哪一点的导数，dx是精准度,y等于f(x)即函数。导数结果就是瞬时变化率。积分很好理解，a为下限，b为上限，y为函数，结果就是y=f(x)下a到b的面积。只要用定积分代入a=0，b=10（10s）y=x（1*x=1）就得到结果。F(x)为原函数，即微分后的函数是f(x)dx，微分前是F(x)一列车初始速度为10m/s，加速度为。才几十行代码，微积分也不是很难啊。，问速度达到20时车走了多少米。阅读详情

1 What is the fastest way to count the number of ones in a given number represented in a

binary form. You can assume that you have infinte run time memory and the response time

should be O(1) always. Can you optimize the memory used?

答案：

int bits_set( int word )
{
int tmp;

tmp = (word >> 1) & 033333333333;
tmp = word - tmp - ((tmp >> 1) & 033333333333);
return (((tmp + (tmp >> 3)) & 030707070707) % 077);

}

有人分析一下么？或者给个更好的解答：）

...全文

AI市场风起云涌，ai浏览器是最佳的落地项目，现在ai市场的ai浏览器竞争加剧，得ai浏览器者得天下！从场景覆盖度来看，AI 浏览器已突破 “网页浏览” 的传统边界，成为连接个人生活、工作、消费的 “超级入口”，这是其他 AI 应用难以比拟的落地优势。在个人生活场景，AI 浏览器可基于用户行为数据主动提供服务 —— 当用户浏览马拉松赛事信息时，浏览器能自动生成 “训练计划 + 装备推荐 + 能量补给方案”，并关联预订链接；在工作场景，Opera Neon 浏览器已实现 “网页内容提取 - 代码生成 - 报告撰写” 的全流程辅助，开发者可直接在浏览器内完成网站开发初稿；阅读详情

大耳

C语言 70,039 成员 243,237 内容

+ 关注 + 加入社区

切换为时间正序

xmdsrswl 2006-08-24

打赏
举报

mark

大耳 2006-08-24

打赏
举报

就是有些难以想通，不知他的工作原理

bohlee 2006-08-24

打赏
举报

MARK

sharkoasis 2006-08-17

打赏
举报

mark

qdhuxp 2006-08-17

打赏
举报

mark

大耳 2006-08-16

打赏
举报

2 What will be the complexity of finding the duplicates in an array?

3 You are given a stack of punched cards, each with m rows and n columns. Come up with a

algorithm to punch holes so that you can find the missing cards (their sequences) in O(1)

time. You can assume that you are looking for a missing card and only one is missing out of
all possibilities.

4 Write the binary search function in a C language.

5 In the given array, find the subsequence with maximum sum and minimum length.
E.g. [10,25,-23,40,-12,39,7] - The subsequence [39,7] has sum of 46 with length 2.

6 Reverse a linked list

7 Write an algorithm to compress a text file

8 How would you implement a BigInt class?

9 If you are given x punched cards each with m rows and n
columns, can u come up with a number scheme to identify missing
patterns.

10 An absolute number is defined as one in which each digit is
strictly smaller than the digit to its right (if any). For e.g. 123,
478, 369 are all absolute numbers. 205, 485 are not. Write a program
to calculate these.

cg5353 2006-08-16

打赏
举报

sankt(黄景天) ( ) 信誉：110
int get_one_1(int x)
{
int countx = 0;
while(x)
{
++countx;
x = x & (x - 1);
}
return countx;
}
这个明显不是 O(1) 阿

Roxxette 2006-08-16

打赏
举报

Question 1
int bits_seta(int w)
{
int t;
t = w - ((w>>1) & 0x55555555);
t = (t & 0x33333333) + ((t>>2) & 0x33333333);
t = (t + (t>>4)) & 0x0f0f0f0f;
t = (t + (t>>8)) & 0x00ff00ff;
t = (t + (t>>16)) & 0x0000ffff;
return t;
}
个人感觉是最优解了，运行一亿次平均时间1.45s，比lz的快1s
而且便于向64位移植-_-!

AdenPlus 2006-08-16

打赏
举报

mark

sankt 2006-08-16

打赏
举报

1 What is the fastest way to count the number of ones in a given number represented in a

binary form. You can assume that you have infinte run time memory and the response time

should be O(1) always. Can you optimize the memory used?

//========
int get_one_1(int x)
{
int countx = 0;
while(x)
{
++countx;
x = x & (x - 1);
}
return countx;
}

blue_zyb 2006-08-16

打赏
举报

Question2:
If sufficient memory is given, then a O(N) complexity

面试题1

相关推荐