Cracking The Coding Interview
shenlan282
这个作者很懒,什么都没留下…
展开
-
Cracking The Coding Interview 9.7
//原文://// A circus is designing a tower routine consisting of people standing atop one another’s shoulders. For practical and aesthetic reasons, each person must be both shorter and lighter than the原创 2014-04-28 23:23:07 · 736 阅读 · 0 评论 -
Cracking The Coding Interview 2.2
#include #include using namespace std;class linklist{private: class node { public: node(){} string data; node * next; }; node *head; int size;public: linklist() { head = new node原创 2014-04-08 21:24:09 · 747 阅读 · 0 评论 -
Cracking The Coding Interview2.3
#include #include using namespace std;class linklist{private: class node { public: node(){} string data; node * next; }; int size;public: node *head; linklist() { head = new n原创 2014-04-08 22:09:58 · 738 阅读 · 0 评论 -
Cracking The Coding Interview 9.1
//原文://// You are given two sorted arrays, A and B, and A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.//// 译文://// A和B是两个有序数组(假设为递增序列),而且A的长度原创 2014-04-23 13:50:38 · 795 阅读 · 0 评论 -
Cracking The Coding Interview 9.0
#include #include using namespace std;void mswap(int &a, int &b){ int c = a; a = b; b = c;}void print(int *a, int size){ for (int i = 0; i<size ; i++) { cout<<a[i]<<" "; }}//Start原创 2014-04-23 13:24:56 · 605 阅读 · 0 评论 -
Cracking The Coding Interview
//原文://// Write a method to sort an array of strings so that all the anagrams are next to each other.// 译文:// 写一个函数对字符串数组排序,使得所有的变位词都相邻。//参考#include #include #include using namespace std;boo转载 2014-04-23 14:40:12 · 691 阅读 · 0 评论 -
Cracking The Coding Interview 2.0 单链表
#include #include using namespace std;class linklist{private: class node { public: node(){} string data; node * next; }; node *first; int size;public: linklist() { first = new no原创 2014-04-08 11:10:18 · 609 阅读 · 0 评论 -
Cracking The Coding Interview 5.6
#include #include using namespace std;int getNum1(int N){ int num=0; for (int i=0; i<32; i++) { int t = N&1; if (t == 1) { num ++; } N = N>>1; } return num;}void print(int p)原创 2014-04-18 12:59:29 · 561 阅读 · 0 评论 -
Cracking The Coding Interview 1.8
//Assume you have a method isSubstring which checks if one word is a substring of another. //Given two strings, s1 and s2, write code to check if s2 is a rotation of s1 using only one call to isSubst原创 2014-04-03 12:25:31 · 654 阅读 · 0 评论 -
Cracking The Coding Interview2.4
// //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. Write a fun原创 2014-04-09 13:31:45 · 1030 阅读 · 0 评论 -
Cracking The Coding Interview 3.6
// Write a program to sort a stack in ascending order. You should not make any assumptions about how the stack is implemented. The following are the only functions that should be used to write this pr原创 2014-04-11 09:57:07 · 641 阅读 · 0 评论 -
Cracking The Coding Interview3.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. Implement原创 2014-04-10 15:17:12 · 681 阅读 · 0 评论 -
Cracking The Coding Interview 9.6
//原文://// Given a matrix in which each row and each column is sorted, write a method to find an element in it.// 从最右一排,从上到下,小于右上角的元素则下降,大于右上角的元素则左移找;第一个相等的元素。#include using namespace std;int se原创 2014-04-28 22:00:02 · 754 阅读 · 0 评论 -
Cracking The Coding Interview 9.6
//原文://// Given a sorted array of strings which is interspersed with empty strings, write a method to find the location of a given string.////Example: find “ball” in [“at”, “”, “”, “”, “ball”, “”,原创 2014-04-28 11:13:05 · 947 阅读 · 0 评论 -
Cracking The Coding Interview 9.3
//Given a sorted array of n integers that has been rotated an unknown number of times, give an O(log n) algorithm that finds an element in the array. You may assume that the array was originally sorte原创 2014-04-28 10:45:17 · 571 阅读 · 0 评论 -
Cracking The Coding Interview 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.//使用一个链表来记录最小值的index原创 2014-04-10 11:39:53 · 467 阅读 · 0 评论 -
Cracking The Coding Interview 2.5
原文:Given a circular linked list, implement an algorithm which returns node at the beginning of the loop.DEFINITIONCircular linked list: A (corrupt) linked list in which a node’s next point转载 2014-04-09 13:33:02 · 1078 阅读 · 0 评论 -
Cracking The Coding Interview2.1 暂存
暂存原创 2014-04-08 21:23:44 · 620 阅读 · 0 评论 -
Cracking The Coding Interview3.4 暂存
暂存原创 2014-04-11 09:52:49 · 599 阅读 · 0 评论 -
Cracking The Coding Interview 3.5
//Implement a MyQueue class which implements a queue using two stacks.#include #includeusing namespace std;class MyQueue{public: stack data,buffer; MyQueue() { } void EnQueue(int e) {原创 2014-04-11 09:54:11 · 635 阅读 · 0 评论 -
Cracking The Coding Interview 5.7
//An array A[1…n] contains all the integers from 0 to n except for one number which is missing. In this problem, //we cannot access an entire integer in A with a single operation. The elements of A a原创 2014-04-18 14:30:14 · 884 阅读 · 0 评论 -
Cracking The Coding Interview 5.5
#include #include using namespace std;int getNum1(int N){ int num=0; for (int i=0; i<32; i++) { int t = N&1; if (t == 1) { num ++; } N = N>>1; } return num;}void print(int p)原创 2014-04-18 12:12:47 · 664 阅读 · 0 评论 -
Cracking The Coding Interview 1.4
//Write a method to decide if two strings are anagrams or not.//// 变位词(anagrams)指的是组成两个单词的字符相同,但位置不同的单词。比如说, abbcd和abcdb就是一对变位词。// // 使用一个固定数组大小记录各个字符出现的次数,同1.1#include using namespace std;bo原创 2014-04-01 16:47:40 · 764 阅读 · 0 评论 -
Cracking The Coding Interview 1.1
//原文://// Implement an algorithm to determine if a string has all unique characters. What if you can not use additional data structures?// // 使用一个数组来记录该字符是否出现过,这里假定只为小写字母。#include using names原创 2014-03-31 13:26:20 · 766 阅读 · 0 评论 -
Cracking The Coding Interview4.3
//Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.//// 译文://// 给定一个有序数组(递增),写程序构建一棵具有最小高度的二叉树。#include #include using namespace std;cl原创 2014-04-15 20:38:57 · 596 阅读 · 0 评论 -
Cracking The Coding Interview 4.4
//Given a binary search tree, design an algorithm which creates a linked list of all the nodes at each depth (i.e., if you have a tree with depth D, you’ll have D linked lists).//// 译文://// 给定一棵二叉原创 2014-04-16 11:56:36 · 658 阅读 · 0 评论 -
Cracking The Coding Interview4.5
//原文://// Write an algorithm to find the ‘next’ node (i.e., in-order successor) of a given node in a binary search tree where each node has a link to its parent.////译文://// 给定二叉查找树的一个结点, 写一个算法查找原创 2014-04-16 14:54:53 · 564 阅读 · 0 评论 -
Cracking The Coding Interview 4.2_暂存
X原创 2014-04-15 15:58:17 · 507 阅读 · 0 评论 -
Cracking The Coding Interview 4.1
//Implement a function to check if a tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that no two leaf nodes differ in distance from the root by more t原创 2014-04-15 15:54:49 · 784 阅读 · 0 评论 -
Cracking The Coding Interview 4.0_二叉树
#include #include using namespace std;class tree{public: tree() { //root = create(); root = NULL; } /***输入扩展层次遍历序列,#表示该节点为空***/ tree(char *s) { root = NULL; if (s == NULL) {原创 2014-04-15 14:45:07 · 605 阅读 · 0 评论 -
Cracking The Coding Interview 1.3
//原文://// Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two additional variables are fine. An extra copy of the原创 2014-04-01 16:28:28 · 514 阅读 · 0 评论 -
Cracking The Coding Interview 1.2
//原文://// Write code to reverse a C-Style String. (C-String means that “abcd” is represented as five characters, including the null character.)//// 从前向后交换,到中间为止#include using namespace std;voi原创 2014-03-31 13:44:57 · 648 阅读 · 0 评论 -
Cracking The Coding Interview 4.6
//原文://// Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree. Avoid storing additional nodes in a data structure. NOTE: This is not necessarily a bina原创 2014-04-17 14:15:02 · 507 阅读 · 0 评论 -
Cracking The Coding Interview5.3 暂存
的原创 2014-04-18 12:12:17 · 699 阅读 · 0 评论 -
Cracking The Coding Interview 1.7
//Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column is set to 0.////这题原答案就是要两个buffer来记录出现0的位置。不知道有没可以不用buffer的方法。#include using namespace std;void setZe原创 2014-04-03 10:39:59 · 715 阅读 · 0 评论 -
Cracking The Coding Interview 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?//// 先转置在上下交换#include原创 2014-04-03 09:45:47 · 550 阅读 · 0 评论 -
Cracking The Coding Interview5.1
//You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i and j in N equal to M (e.g., M becomes a substring of N located at i and starting原创 2014-04-18 01:17:38 · 603 阅读 · 0 评论 -
Cracking The Coding Interview5.2
//Given a (decimal - e.g. 3.72) number that is passed in as a string, print the binary representation.If the number can not be represented accurately in binary, print “ERROR”.//前面有个打印整数的了,这里只打印小数.#i原创 2014-04-18 01:48:30 · 651 阅读 · 0 评论 -
Cracking The Coding Interview4.8
//You are given a binary tree in which each node contains a value. Design an algorithm to print all paths which sum up to that value. Note that it can be any path in the tree - it does not have to sta原创 2014-04-17 22:27:48 · 697 阅读 · 0 评论 -
Cracking The Coding Interview 1.5
//原文://// Write a method to replace all spaces in a string with ‘%20’.//#include using namespace std;char* replace(char * str){ if (str == NULL) { return NULL; } int size = strlen(str);原创 2014-04-02 15:52:34 · 675 阅读 · 0 评论