E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
CareerCup
[
CareerCup
] 5.4 Explain Expression ((n & (n-1)) == 0) 解释表达式
5.4Explainwhatthefollowingcodedoes:((n&(n-1))==0). 这道题让我们解释一个表达式((n&(n-1))==0),是说一个数跟比它小1的数字按位相与,结果全是0的情况,那么说明两个数每个位置上至少都有一个0,那么最有可能的情况是连个数的各个位置的数是相反的,而且还要相差1,那么最后可能的情况是一个数的最高位是1,其余位都是0,则其减1即为向最高位借1,
Grandyang
·
2015-08-13 22:00
[
CareerCup
] 5.3 Next Binary Representation 下一个二进制表达
5.3Givenapositiveinteger,printthenextsmallestandthenextlargestnumberthathavethesamenumberof1bitsintheirbinaryrepresentation.
Grandyang
·
2015-08-12 21:00
[
CareerCup
] 5.2 Binary Representation of Real Number 实数的二进制表示
5.2Givenarealnumberbetween0and1(e.g.,0.72)thatispassedinasadouble,printthebinaryrepresentation.Ifthenumbercannotberepresentedaccuratelyinbinarywithatmost32characters,print"ERROR."
Grandyang
·
2015-08-11 15:00
[
CareerCup
] 5.1 Insert Bits 插入位
5.1Youaregiventwo32-bitnumbers,NandM,andtwobitpositions,landj.WriteamethodtoinsertMintoNsuchthatMstartsatbitjandendsatbiti.YoucanassumethatthebitsjthroughihaveenoughspacetofitallofM.Thatis,ifM=10011,
Grandyang
·
2015-08-10 09:00
[
CareerCup
] 4.9 All Paths Sum 所有路径和
4.9Youaregivenabinarytreeinwhicheachnodecontainsavalue.Designanalgorithmtoprintallpathswhichsumtoagivenvalue.Thepathdoesnotneedtostartorendattherootoraleaf. 这道题给我们一个二叉树,让我们找出所有的路径,其和为给定的值,而且说了路径不必起始于
Grandyang
·
2015-08-09 10:00
[
CareerCup
] 4.8 Contain Tree 包含树
4.8Youhavetwoverylargebinarytrees:Tl,withmillionsofnodes,andT2,withhundredsofnodes.CreateanalgorithmtodecideifT2isasubtreeofTl.AtreeT2isasubtreeofTlifthereexistsanodeninTlsuchthatthesubtreeofnisident
Grandyang
·
2015-08-08 11:00
[
CareerCup
] 4.7 Lowest Common Ancestor of a Binary Search Tree 二叉树的最小共同父节点
4.7Designanalgorithmandwritecodetofindthefirstcommonancestoroftwonodesinabinarytree.Avoidstoringadditionalnodesinadatastructure.NOTE:Thisisnotnecessarilyabinarysearchtree. LeetCode上的原题,请参见我之前的博客Lowes
Grandyang
·
2015-08-07 23:00
[
CareerCup
] 4.6 Find Next Node in a BST 寻找二叉搜索树中下一个节点
4.6Writeanalgorithmtofindthe'next'node(i.e.,in-ordersuccessor)ofagivennodeinabinarysearchtree.Youmayassumethateachnodehasalinktoitsparent. 这道题实际上考察的是一种叫线索二叉树的数据结构,而构造这种树的方法称之为Morris遍历法,在我之前的博客BinaryT
Grandyang
·
2015-08-06 23:00
[
CareerCup
] 4.5 Validate Binary Search Tree 验证二叉搜索树
4.5Implementafunctiontocheckifabinarytreeisabinarysearchtree. LeetCode上的原题,请参见我之前的博客ValidateBinarySearchTree验证二叉搜索树。
Grandyang
·
2015-08-03 23:00
谷歌面经 Tree Serialization
http://www.
careercup
.com/question?
huashiyiqike
·
2015-08-03 10:00
[
CareerCup
] 4.4 Create List at Each Depth of Binary Tree 二叉树的各层创建链表
4.4Givenabinarytree,designanalgorithmwhichcreatesalinkedlistofallthenodesateachdepth(e.g.,ifyouhaveatreewithdepthD,you'llhaveDlinkedlists).
Grandyang
·
2015-08-01 23:00
[
CareerCup
] 4.3 Create Minimal Binary Search Tree 创建最小二叉搜索树
4.3Givenasorted(increasingorder)arraywithuniqueintegerelements,writeanalgorithmtocreateabinarysearchtreewithminimalheight. 这道题给了我们一个有序的数组,让我们来生成一个最小高度的二叉搜索树,为了达到最小高度,肯定是尽可能的填成一个满二叉树,左子树填满,右子树尽可能的填满。而
Grandyang
·
2015-07-31 23:00
[
CareerCup
] 4.2 Route between Two Nodes in Directed Graph 有向图中两点的路径
LeetCode和
CareerCup
中关于图的题都不是很多,LeetCode中只有三道,分别是CloneGraph无向图的复制,CourseSchedule课程清单和CourseScheduleII课程清单之二
Grandyang
·
2015-07-30 23:00
[
CareerCup
] 4.1 Balanced Binary Tree 平衡二叉树
4.1Implementafunctiontocheckifabinarytreeisbalanced.Forthepurposesofthisquestion,abalancedtreeisdefinedtobeatreesuchthattheheightsofthetwosubtreesofanynodeneverdifferbymorethanone. LeetCode上的原题,请参见我之
Grandyang
·
2015-07-29 13:00
面试的时候的一些记录 - 不断更新
学长们的求职血泪史(C/C++/JAVA)http://blog.csdn.net/huomanqingying/article/details/12876759菜鸟用
careercup
书和leetcode
mandagod
·
2015-07-29 11:00
[
CareerCup
] 3.7 Adopt Animal 领养动物
3.7Ananimalshelterholdsonlydogsandcats,andoperatesonastrictly"firstin,firstout"basis.Peoplemustadopteitherthe"oldest"(basedonarrivaltime)ofallanimalsattheshelter,ortheycanselectwhethertheywouldprefer
Grandyang
·
2015-07-28 12:00
[
CareerCup
] 3.3 Set of Stacks 多个栈
3.3 Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previous stack exceeds some threshold.
·
2015-07-26 08:00
stack
[
CareerCup
] 3.2 Min Stack 最小栈
3.2 How would you design a stack which, in addition to push and pop, also has a function min which returns the minimum element? Push, pop and min should all operate in O(1) time. Leet
·
2015-07-25 12:00
stack
[
CareerCup
] 3.1 Implement Three Stacks using Array 使用数组来实现三个栈
3.1 Describe how you could use a single array to implement three stacks. 这道题让我们用一个数组来实现三个栈,书上给了两种方法,第一种方法是定长分割 Fixed Division,就是每个栈的长度相同,用一个公用的一位数组buffer来保存三个栈的内容,前三分之一为第一个栈,中间三分之一为第二
·
2015-07-25 12:00
array
[
CareerCup
] 2.6 Linked List Cycle 单链表中的环
2.6 Given a circular linked list, implement an algorithm which returns the node at the beginning of the loop.DEFINITIONCircular linked list: A (corrupt) linked list in which a node's next poin
·
2015-07-21 20:00
list
[
CareerCup
] 2.5 Add Two Numbers 两个数字相加
2.5 You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Writ
·
2015-07-20 20:00
number
Google Interview - Compress String to i18n
careercup
"=>"c7p","ca6p","c6up","
yuanhsh
·
2015-07-20 11:00
[
CareerCup
] 2.3 Delete Node in a Linked List 删除链表的节点
2.3 Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.EXAMPLEInput: the node c from the linked list a->b->c->d->eResult:
·
2015-07-19 12:00
delete
[
CareerCup
] 2.2 Kth to Last Element of Linked List 链表的倒数第k个元素
2.2 Implement an algorithm to find the kth to last element of a singly linked list. 这道题让我们求链表中倒数第k个元素,LeetCode中相类似的题目有Kth Largest Element in an Array 数组中第k大的数字 和 Kth Smalles
·
2015-07-19 12:00
element
[
CareerCup
] 2.1 Remove Duplicates from Unsorted List 移除无序链表中的重复项
2.1 Write code to remove duplicates from an unsorted linked list.FOLLOW UPHow would you solve this problem if a temporary buffer is not allowed? 这道题让我们移除无序链表中的重复项,在LeetCode中有两道类似的题是Re
·
2015-07-18 10:00
remove
[
CareerCup
] 1.6 Rotate Image 翻转图像
1.6 Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place? LeetCode中的原题,请参见
·
2015-07-17 05:00
image
[
CareerCup
] 1.5 Compress String 压缩字符串
1.5 Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" str
·
2015-07-17 03:00
compress
[
CareerCup
] 1.4 Replace Spaces 替换空格
1.4 Write a method to replace all spaces in a string with '%20'. You may assume that the string has sufficient space at the end of the string to hold the additional characters, and that you ar
·
2015-07-16 11:00
replace
[
CareerCup
] 1.3 Permutation String 字符串的排列
1.3 Given two strings, write a method to decide if one is a permutation of the other. 这道题给定我们两个字符串,让我们判断一个是否为另一个的全排列字符串。在LeetCode中,关于排列的题有如下几道,Permutation Sequence 序列排序,Permutations 全
·
2015-07-16 08:00
String
[
CareerCup
] 1.2 Reverse String 翻转字符串
1.2 Implement a function void reverse(char *str) in C or C++ which reverses a null-terminated string. 这道题让我们用C++或C语言来翻转一个字符串,不算一道难题,在之前那道Reverse Words in a String 翻转字符串中的单词中用到了这个函数,跟那
·
2015-07-15 23:00
String
[
CareerCup
] 1.1 Unique Characters of a String 字符串中不同的字符
1.1 Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structure? 这道题让我们判断一个字符串中是否有重复的字符,要求不用特殊的数据结构,这里应该是指哈希表之类的不让用。像普通
·
2015-07-15 13:00
character
Hackerrank - The Good Node
原题来自
Careercup
:http://www.
careercup
.com/question?
yuanhisn
·
2015-05-28 09:00
程序员不得不知道的技术面试资料大全
CareerCup
.comCC150作者搞的网站,也是著名的漏题网站之一。大家会在上面讨论各个公司的面试题。Glassdoor.com一个给公司打分的网站,类似yelp的公司版。
九章算法
·
2015-05-13 02:12
技术资料
Matrix
(难点 注意第12题) Q: Print a matrix spirally A: <http://www.
careercup
.com/question?
yuanhsh
·
2015-03-15 00:00
Matrix
Matrix
(难点 注意第12题) Q: Print a matrix spirally A: <http://www.
careercup
.com/question?
yuanhsh
·
2015-03-15 00:00
Matrix
[转帖] 一些算法刷题的网站
1. leetcode http://leetcode.com/ 2. careerup http://www.
careercup
.com/
·
2015-02-17 03:00
算法
Google面试官Gayle McDowell:找一家能让你开心的公司
非商业转载请注明作译者、出处,并保留本文的原始链接:http://www.ituring.com.cn/article/66910GayleMcDowell是
CareerCup
创始人、Google资深面试官
图灵访谈
·
2015-01-05 00:00
图灵访谈
google
面试
CareerCup
17 中等难题 Q17.4 不用比较找出两数较大值
题目:编写一个方法,找出两个数字中最大的那一个。不得使用if-else或其他比较运算符。分析:不准使用正常方法的题目,多数要考虑位运算了。这道题就是考虑,a-b的符号。因为Java整形是4个字节,按位右移31位就得到符号位,别忘了和1按位与(因为负数按位右移高位补1),这是0为正,1为负,如果想取反,那么再和1取异或。主要思想就是以上,有一点特殊的就是,溢出的问题,如果溢出的话,就可能截断,造成符
ustc_summer
·
2014-11-06 16:00
Careercup
不用比较找出两数较大值
CareerCup
17中等难题 Q17.3 阶乘尾随零个数
题目:设计一个算法,算出n阶乘有多少个尾随零。分析:就是算,阶乘中总共有几个2*5,又因为2总是比5多,所以算出有几个5相乘就可以。注意:25算两个,因为5*5,125算三个,因为5*5*5.具体算法是这样,第一遍,算阶乘中5的倍数有几个,即n/5第二遍,算阶乘中25的倍数有几个,即n/25,(这里25就不用算两次,因为在算5的倍数时已经算了一次25)。。。。。。最后将这些结果相加即为所求。pac
ustc_summer
·
2014-11-06 13:00
Careercup
阶乘尾随零个数
CareerCup
17中等难题 Q17.2 井字游戏
题目:设计一个算法,判断玩家是否赢了井字游戏。分析:就是判断一个N*N矩阵,是否存在一行,一列,两对角线上元素全部相等。packagecci.section17; publicclassCCI_17_2{ publicstaticinthasWon(int[][]board){ intN=board.length; //行 for(inti=0;i
ustc_summer
·
2014-11-06 12:00
井字游戏
Careercup
CareerCup
17中等难题 Q17.1 不用临时变量,直接交换两个数
题目:编写一个函数,不用临时变量,直接交换两个数。分析:这是位运算异或的典型应用,已经上了百度百科。对两个数进行三次异或就可以。packagecci.section17; publicclassCCI_17_1{ publicstaticvoidswap(inta,intb){ a=a^b; b=a^b; a=a^b; //直接在这里输出,因为Java参数是值传递 System.out.pri
ustc_summer
·
2014-11-06 11:00
位运算
异或
Careercup
不用临时变量直接交换两个数
一些算法刷题的网站
阅读更多1.leetcodehttp://leetcode.com/2.careeruphttp://www.
careercup
.com/http://hawstein.com/posts/ctci-solutions-contents.html3
chriszeng87
·
2014-09-04 22:00
算法
一些算法刷题的网站
1. leetcode http://leetcode.com/ 2. careerup http://www.
careercup
.com/ http:/
chriszeng87
·
2014-09-04 22:00
算法
CareerCup
递归与动态规划 Q9.10 最大高度堆箱子
给你一堆n个箱子,箱子宽wi、高hi、深di。箱子不能翻转,将箱子堆起来时,下面箱子的宽度、高度和深度必须大于上面的箱子。实现一个方法,撘出最高的一堆箱子,箱堆的高度为每个箱子高度的总和。分析:用递归,子问题为以某一个箱子为底的高度最高的塔,确定底后,找到一个可以放在底上的箱子,再递归求解子问题。注意:存在重复子问题,考虑用动态规划,用表记录中间结果,以便之后查询。packagecci; imp
ustc_summer
·
2014-08-15 14:00
Careercup
最大高度堆箱子
矩阵旋转(图像旋转)
CareerCup
原题:GivenanimagerepresentedbyanNxNmatrix,whereeachpixelintheimageis4bytes,writeamethodtororatetheimageby90degrees.Canyoudothisinpalce
KangRoger
·
2014-08-06 16:09
面试笔试题目
矩阵旋转(图像旋转)
CareerCup
原题:GivenanimagerepresentedbyanNxNmatrix,whereeachpixelintheimageis4 bytes,writeamethodtororatetheimageby90degrees.Canyoudothisinpalce
KangRoger
·
2014-08-06 16:00
C++
图像
矩阵
笔试面试题目
开始编程生涯的5个建议,增加编程经验的3种途径,谈程序员面试的技巧和建议
她现在是
CareerCup
和SeattleAnti-Freeze两家公司的创始人兼CEO。她也是《CrackingtheC
紫荆飘香V
·
2014-07-26 03:42
面经
CareerCup
Chapter 9 Sorting and Searching
9.1Youaregiventwosortedarrays,AandB,andAhasalargeenoughbufferattheendtoholdB.WriteamethodtomergeBintoAinsortedorder. AhasenoughbufferattheendtoholdB,wecanmergetwoarraysfromendtostartindex,likemerge
star_liux
·
2014-06-14 17:00
CareerCup
chapter 8 Recursion
8.1 WriteamethodtogeneratethenthFibonaccinumber. Recursivesolution: intfib(n){ if(n==0)return0; elseif(n==1)return1; elseif(n>1)returnfib(n-1)+fib(n-2); elsereturn-1; } Ite
star_liux
·
2014-06-12 11:00
LeetCode
CareerCup
chapter 5 Bit Manipulation
5.1 Youaregiventwo32-bitnumbers,NandM,andtwobitpositions,iandjWriteamethodtosetallbitsbetweeniandjinNequaltoM(eg,MbecomesasubstringofNlocatedatiandstartingatj)EXAMPLE:Input:N=10000000000,M=10101,i=2,j
star_liux
·
2014-06-07 09:00
c
Careercup
上一页
4
5
6
7
8
9
10
11
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他