摘要： 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”.string print_binary(string val){ int pos = val.find('.',0); int intpart = atoi(val.substr(0,pos).c_str()); double doub. 阅读全文

摘要： 给定两个32位的数，N和M，还有两个指示位的数，i和j。 写程序使得N中第i位到第j位的值与M中的相同(即：M变成N的子串且位于N的第i位和第j位之间) 1 int updateBits(int n,int m,int i,int j) 2 { 3 int max = ~0; 4 int left = max -((1<<j+1)-1); 5 int right = 1<<i -1; 6 7 int mask = left|right; 8 9 return (n&mask)|(m<<i);10 } 阅读全文

摘要： 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 binary search tree. 1 bool covers(Node *root,Node *p) 2 { 3 if(!root) return false; 4 if(root==p) return tru... 阅读全文

摘要： 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. 1 typedef struct Node 2 { 3 int val; 4 Node *left,*right,*parent; 5 }Node; 6 7 Node* GetSuccessor(Node* node) 8 { 9 if(node->right)10 ... 阅读全文

摘要： 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).#include typedef struct Node{ int val; Node *left,*right;}vector> findLevelList(Node *root){ int level = 0; vecto... 阅读全文

摘要： Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.typedef struct Node{ int val; Node *left,*right; Node(int v){ val = v;left = right = NULL;}}Node;Node* createTree(int a[],int start,int end){ if(startleft = createTree(a,start,mid-1); ... 阅读全文

摘要： Given a directed graph, design an algorithm to find out whether there is a route between two nodes.//BFS#include #include using namespace std;int n;bool visited[n];bool m[n][n];bool hasRoot(int src,int dst){ queue q; memset(visited,false,sizeof(visited)); q.push(src); while(!q.empty(... 阅读全文

摘要： 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 than one. 1 int d=0,min=INT_MAX,max = INT_MIN; 2 3 void GetMaxAndMin(Node *root) 4 { 5 if(!root->l.. 阅读全文

摘要： 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 program: push | pop | peek | isEmpty. 1 stack Ssort(stack s){ 2 stack t; 3 while(!s.empty()){ 4 ... 阅读全文

摘要： 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. 1 template 2 class StackWithMin 3 { 4 public: 5 stack() 6 { 7 stackTop = -1; 8 minStackItemIndex = -1... 阅读全文