王朝网络

分享

 

01.CSAPP Lab2: Binary Bomb
CSAPP Lab2: Binary Bomb著名的CSAPP实验：二进制炸弹就是通过gdb和反汇编猜测程序意图，共有6关和一个隐藏关卡只有输入正确的字符串才能过关，否则会程序会bomb终止运行隐藏关卡需要输入特定字符串方会开启实验材料...查看完整版>>CSAPP Lab2: Binary Bomb02.Leetcode: Binary Search Tree Iterator
Leetcode: Binary Search Tree IteratorImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest n...查看完整版>>Leetcode: Binary Search Tree Iterator03.Lintcode: Binary Representation
Lintcode: Binary RePResentationGiven a (decimal - e g 3.72) number that is passed in as a string,return the binary representation that is passed in as a string.If the number can not be represented ac...查看完整版>>Lintcode: Binary Representation04.Lintcode: Search Range in Binary Search Tree
Lintcode: Search Range in Binary Search TreeGiven two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Find all the keys of tree in range k1 to k2. i.e. PRint all x such...查看完整版>>Lintcode: Search Range in Binary Search Tree05.Leetcode: Binary Tree Right Side View
Leetcode: Binary Tree Right Side ViewGiven a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the...查看完整版>>Leetcode: Binary Tree Right Side View06.[LeetCode] Invert Binary Tree
Invert Binary TreeInvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1 这道题呢=。=看着题目简介挺有意思的。哈哈哈。~说实话我真的很讨厌whiteb...查看完整版>>[LeetCode] Invert Binary Tree07.[LeetCode] Balanced Binary Tree
Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this PRoblem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees ofeveryno...查看完整版>>[LeetCode] Balanced Binary Tree08.[LeetCode] Binary Tree Right Side View
Binary Tree Right Side ViewGiven a binary tree, imagine yourself standing on therightside of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the following b...查看完整版>>[LeetCode] Binary Tree Right Side View09.[LeetCode] Binary Search Tree Iterator
Binary Search Tree IteratorImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callingnext()will return the next smallest number in the...查看完整版>>[LeetCode] Binary Search Tree Iterator10.[LeetCode] Lowest Common Ancestor of a Binary Search Tree
Lowest Common Ancestor of a Binary Search TreeGiven a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to thedefinition of LCA on Wikipedia: &ldq...查看完整版>>[LeetCode] Lowest Common Ancestor of a Binary Search Tree

 

 

免责声明：本文为网络用户发布，其观点仅代表作者个人观点，与本站无关，本站仅提供信息存储服务。文中陈述内容未经本站证实，其真实性、完整性、及时性本站不作任何保证或承诺，请读者仅作参考，并请自行核实相关内容。