w*******y
发帖数: 60932 | 1 Amazon is offering the LG BD530 Blu-Ray player for $79.99 preorder. There is
no release date, but for what you get, its a good price for a new Blu-Ray
player. Does not seem to have Netflix, however.
Blu-ray, DVD and CD disc playback
Full HD 1080p output makes the most of your HD TV
Standard DVD up-scaling to 1080p makes your existing DVDs look great
Access internet services YouTube, Picasa and Accuweather without your PC
Access real time Blu-ray extras via BD-Live
Link:
http://www.amazon.com/gp/... 阅读全帖 |
|
|
w*******y
发帖数: 60932 | 3 link:
http://www.target.com/dp/B0043FI1O0/184-2482928-9658639
preorder for arrival in 2-4 weeks, may not make Christmas but a great deal
anyway
was $10 now $5 and free shipping
use code ER5PVIIO at checkout for 10% off = $4.50 plus tax
there are several cashback sites you can use, as well as Shopdiscover for 5%
CB
e.l.f. Studio Endless Eyes Pro Eyeshadow Palette Limited Edition
info from eyeslipsface.com:
Become your own makeup artist whenever, wherever with our amazing
Professional Eyeshadow... 阅读全帖 |
|
|
|
w*******y
发帖数: 60932 | 6 Preorder Crysis 2 $49.99 with free shipping
EMCYTZT309 - Promo Code for PC
EMCYTZT303 - Promo Code for XBOX 360
EMCYTZT312 - Promo Code for PS3
Deals expire at 11:59PM PST on Sunday, 2/20/2011
|
|
w*******y
发帖数: 60932 | 7 The Walking Dead Blu Ray:
http://www.amazon.com/The-Walking-Dead-The-Complete-First-Seaso
preorder sale on Amazon for $22.99. Best price so far with less then a
week to release.
quote
Product Description
After waking from a coma in an abandoned hospital, police officer Rick
Grimes finds the world he knew gone - ravaged by a zombie epidemic of
apocalyptic proportions. Nearby, on the outskirts of Atlanta, a small
encampment struggles to survive as 'the dead' stalk them at every turn. Can
Rick ... 阅读全帖 |
|
w*******y
发帖数: 60932 | 8 Witcher 2 Preorder $36
Witcher 2 Assassins of Kings Digital Premium Download:
http://www.direct2drive.com/3/10030/product/Buy-The-Witcher-2:-
Coupon Code: "Showers" gives you an additional 20% off.
Premium Includes:
Making-of
All the cinematic materials related to game - trailers, developer diaries,
gameplay footage, interviews and making-of exclusive video.
Soundtrack
Audio files with in-game music.
Game Manual
A rulebook and interface explanation to help you get started.
Game Guide
The Witcher... 阅读全帖 |
|
w*******y
发帖数: 60932 | 9 Link:
http://www.amazon.com/gp/browse/ref=pe_37760_19563330_pe_00_hea
Clip which version you want! These expire 4/30. They are only valid on the
3D blu-ray bundle (making it $28.99) or the Trilogy pack (making it $68.99.)
The Trilogy includes The Lion King, The Lion King 1 1/2 and The Lion King 2.
These may be cheaper in store especially with DMR coupons, but I always
preorder one through Amazon to be safe,
|
|
w*******y
发帖数: 60932 | 10 Stolen from theone007
Best Buy has dropped their price to $48.99 and the other preorder offers are
still included. I called CSR and got a credit back for the three orders I
placed earlier
PS3
360 [bestbuy.com]
|
|
|
|
|
|
|
|
w*******y
发帖数: 60932 | 17 GMG is having their Autumn sale with a 20% off voucher for most of their
games.
The biggest value that I saw was the preorder for Batman Arkham City
Link:
http://www.greenmangaming.com/games/action/batman-arkham-city/
Use voucher: AUTUM-NSALE-20PEC
Expires on 10/17
Note: game cannot be activated through Steam.. even if it did, you'd still
have to use GFWL just like in Arkham Asylum, but for this price, it's pretty
hard to pass up for what will most likely be an excellent game.
|
|
|
|
|
|
w*******y
发帖数: 60932 | 22 PoeticBasic Snap On Slim-Fit PC Hard Case for The New iPad (3rd Gen) / iPad
3 /iPad HD - Crystal Clear Preorder $9.95 FS
Ships March 16, 2012
was $19.95
Link:
http://www.amazon.com/gp/product/B007JBN6AO
3 Year Manufacturer Warranty From Poetic
Technical Details
High Quality Durable PC Case designed for the New iPad (3rd Gen) / iPad 3 /
iPad HD ( will not fit iPad 2)
Flexible and unbreakable
|
|
|
|
J********r
发帖数: 36 | 25 如题，我试着减少xsl里的代码，程序就能正常运行了，感觉是ＸＳＬ文件里的代码太
长了，但是又不能减少。一直调试不出来。 Ｓｔａｃｋ Ｔｒａｃｅ如下：
javax.xml.transform.TransformerException: java.lang.
ArrayIndexOutOfBoundsException: -1
at com.sun.org.apache.xalan.internal.xsltc.trax.TransformerImpl.
transform(TransformerImpl.java:716)
at com.sun.org.apache.xalan.internal.xsltc.trax.TransformerImpl.
transform(TransformerImpl.java:313)
at preorder.XslResponseProcessor.transformResponse(XslResponseProcessor.
java:81)
at preorder.webservice.invoker.IaEdiI... 阅读全帖 |
|
w******j
发帖数: 185 | 26 来个java的吧，带parent pointer和不带的，preorder和inorder的
import java.util.NoSuchElementException;
import java.util.Stack;
public class BST {
private Node root;
private static class Node {
int key;
Node left, right, parent;
Node(int key) {
this.key = key;
}
}
public BST(){
}
public BSTIterator inorderIterator() {
return new InorderIterator();
}
public BSTIterator preorderIterator() {
return new PreorderI... 阅读全帖 |
|
w******j
发帖数: 185 | 27 来个java的吧，带parent pointer和不带的，preorder和inorder的
import java.util.NoSuchElementException;
import java.util.Stack;
public class BST {
private Node root;
private static class Node {
int key;
Node left, right, parent;
Node(int key) {
this.key = key;
}
}
public BST(){
}
public BSTIterator inorderIterator() {
return new InorderIterator();
}
public BSTIterator preorderIterator() {
return new PreorderI... 阅读全帖 |
|
x********u
发帖数: 1150 | 28 cc 150 上是用preorder and inorder, 同时加上sentinel to mark null node.
我觉得inorder是没有必要的.
感觉需要严格的数学证明.
如果tree T contains tree S, T's preorder (with sentinel to mark null) 的
string 肯定 contains S's preorder string.
反方向, 如果T's preorder string contains S's preorder string, 就一定能推出 "
tree T contains tree S"?
如果preorder+sentinel不足够的话, 能不能给个反例来说明 inorder是必须的. |
|
w*******u
发帖数: 267 | 29 Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
https://leetcode.com/problems/construct-binary-tree-from-preorder-and-
inorder-traversal/
————————————————————————————————————
我的解法
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
struct TreeNode* buildTree(int* preorder, int preorderSize, int* inorder,
int inorderSi... 阅读全帖 |
|
e***s
发帖数: 799 | 30 一个简单的construct BT with preorder and inorder.
这是1337code大哥的C++ code(递归部分）.
root->left = buildInorderPreorder(in, pre+1, i, offset);
root->right = buildInorderPreorder(in+i+1, pre+i+1, n-i-1, offset+i+1);
但是在C#中不在unsafe block里面不能用指针(我也不想用指针）。
有什么方法能写得这么简洁呢？
int[] linorder = new int[divider];
int[] lpreorder = new int[divider];
int[] rinorder = new int[n - divider - 1];
int[] rpreorder = new int[n - divider - 1];
for(int i = 0; i < divider... 阅读全帖 |
|
l****p
发帖数: 397 | 31 我觉得这题主要是考怎么构建树，至于树建起来了，怎么展现比较漂亮那是另一回事了
。这年头很少人会考用ASCII字符在控制台上打图形吧。顺便贴上我的实现：
class TreeNode
attr_accessor :value
attr_accessor :left
attr_accessor :right
def initialize value
@value = value
end
end
def get_trees preorder, head=0, tail=preorder.size
return [nil] if tail <= head
trees = []
for right_root in (head+1..tail)
left_trees = get_trees preorder, head+1, right_root
right_trees = get_trees preorder, right_root, tail
left_trees.each do |lt|
right_tree... 阅读全帖 |
|
c**y
发帖数: 172 | 32 问题简单概述：Binary Tree T1（大）和T2（小），判断T2是不是T1的substree。
CC150给的解法是对于每一个Tree，用InOrder和PreOrder的方法生成两个序列，然后判
断T2的两个序列是不是T1两个序列的substring。CC150还有brutal force的解法（这里
就不讨论了）。
我的问题是
1.这个序列比较的解法要求T1和T2不能有duplicate元素？这个应该是确定的，参见
http://www.geeksforgeeks.org/check-if-a-binary-tree-is-subtree-
2.为什么不比较PostOrder生成的序列呢？下面是一个反例（如果只用PreOrder和
InOrder
，返回True，但是实际应该是False）
T1:
1
/ \
2 3
\
4
T2:
1
/ \
2 3
T1:
InOrder: 2134
PreOrder: 1234
T2:
InOrder: 213
PreOrder: 123
如果只用InOrder和... 阅读全帖 |
|
i**********e
发帖数: 1145 | 33 序列化（Serialization）真的很有用，例如我在网站实现这个 online judge 就有用
到。ie，怎么把 binary tree，linked list，array 的函数传递参数等用 string 的
形式打印出来。
http://www.ihas1337code.com/onlinejudge
序列化 (Serialization) 二叉树是 amazon 常问题。可以好几种方法实现。
1） preorder/postorder/levelorder + inorder. 这前提是树里不能有任何重复值，
否则会有 ambiguity. 给个例子：
preorder = {7, 7}
inorder = {7, 7}
http://www.ihas1337code.com/2011/04/construct-binary-tree-from-
2）preorder/level order traverse + mark sentinel. 这个用一个 preorder
traversal 就能完成，很简单。但是缺点就是要利用一个 sentinel 来 mark。万一树... 阅读全帖 |
|
d****2
发帖数: 6250 | 34 preorder: 1 2 3 4 5
inorder: 3 2 4 1 5
root 1
left subtree preorder 2 3 4
left subtree inorder 3 2 4
right subtree preorder 5
right subtree inorder 5
recursively work on left subtree and right subtree with the known
preorder and inorder lists. |
|
i**********e
发帖数: 1145 | 35 不好意思，可能破坏你这道面试题了。
假设定义为 general tree 的 postorder traversal 是遍历完current node的所有
children再遍历currentnode。
那么主要的trick是要发现 general tree (GT) 的 preorder 跟 binary tree
representation (BTR) 的 preorder 是一样的。另外，GT 的 postorder 和 BTR 的
inorder 遍历也是一样的。
所以重建树就成为了 BTR 的 preorder 和 inorder.
所以这题主要就利用经典的 preorder 和 inorder 遍历重建二叉树，然后再把 BTR 转化成 GT，不知道说对了没有？
http://www.cs.rutgers.edu/~kaplan/503/handouts/btreconNgentrees |
|
o*q
发帖数: 630 | 36 # Title Editorial Acceptance Difficulty Frequency
1
Two Sum 28.3% Easy
292
Nim Game 54.4% Easy
344
Reverse String 57.3% Easy
136
Single Number 52.2% Easy
2
Add Two Numbers 25.6% Medium
371
Sum of Two Integers 51.6% Easy
4
Median of Two Sorted Arrays
20.4% Hard
6
ZigZag Conversion 25.6% Easy
13
Roman to Integer 42.7% Easy
237
... 阅读全帖 |
|
y****n
发帖数: 15 | 37 题目描述 Q4.8：
You have two very large binary trees: T1, with millions of nodes, and T2,
with hundreds of nodes. Create an algorithm to decide if T2 is a subtree of
T1.
书中的解法一：
If T2’s preorder traversal is a substring of T1’s preorder traversal, and
T2’s inorder traversal is a substring of T1’s inorder traversal, then T2
is a subtree of T1.
我感觉这个方法可能有问题。虽然通过preorder和inorder遍历，可以唯一的定义一棵
树。但是如果T2是T1的子树，遍历字符串S2是S1的子串，那么S2可能对应到S1的不同位
置。举例来说，下面两棵树就满足S2是S1的子串，但T2不是T1的子树。
请众位高手帮忙检查一下，是我的结果有问题，还是书中有错误，多谢！
... 阅读全帖 |
|
w*******y
发帖数: 60932 | 38 While Amazon is offering a $10 credit for Saint's Row the Third preorders,
the official Saint's Row website is offering a free DLC Season Pass worth $
19.99 with preorders. The season pass includes three to be released DLCs + a
bonus.
More info on the season pass can be found here:
Link:
http://www.gaming-age.com/news/2011/11/10-32/thq-announces-seas
The game can be preordered (Xbox 360, PS3, or PC) from the official website
here:
Link:
http://www.saintsrow.com/preorder
|
|
e****n
发帖数: 33 | 39 今天去bestbuy问卖不卖iphone5 device only,说有。而且还说了半天除了preorder的
才能卖。问了我半要天不要开计划。我说不要。手机都拿出来开始check out了。期间
倒是一直在和一个他的manager短信（后来我才知道是manager）。最后说，不卖给你了
。我们要留给preorder的人
我觉得明显这是preorder剩下来的机子，是中间manager发短信不想卖给我了。为什么
呢？难道因为我是中国人？大家说说。反正很不爽 |
|
d****2
发帖数: 6250 | 40 struct tree_node {
int x;
tree_node *left;
tree_node *right;
};
tree_node *build_tree(const std::vector &preorder, int start1, int end1
, const std::vector &inorder, int start2, int end2) {
if (start1 > end1)
return NULL;
if (start1 == end1) {
tree_node *tn = new tree_node;
tn->x = preorder[start1];
tn->left = NULL;
tn->right = NULL;
return tn;
}
int pos;
for (pos = start2; pos <= end2; pos++)
if (inorder[pos] == preorder[start1])
|
|
I**A
发帖数: 2345 | 41 这个和地主那个，各有利弊，地主那个很好理解。。
这个有没有bug？我写了个java version，对某些树，不work, 帮着看看，哪儿的问题？
public static Node buildTree(int[] preorder, int start1, int[] inorder,
int start2, int len){
if(len<=0)
return null;
Node node = new Node(preorder[start1]);
int k;
for(k=start2; k
if(inorder[k] == preorder[start1])
break;
if(k==start2+len)
return null;
node |
|
i****c
发帖数: 102 | 42 这题有意思！
1）easy, recursive or iterative algorithm
2) preorder+inorder, preorder+marker, level-by-level, etc.
3) I will prefer to use preorder+marker so that we can find the path to
leaves
without constructing trees in memory
A quick thought, we can do serilization by repeating parent nodes (correct
me if you find errors)
e.g., a tree, root is A, A's left is B, right is C, B's right is D, and C's
left and right are E and F respectively.
then we have AB?DACECF, ? indicates a null
4) distribute small... 阅读全帖 |
|
b*******y
发帖数: 232 | 43 我觉得第四题的思路是这样的
记得preorder和inorder能完全决定一棵binary tree
那么现在有了preorder，只要找出所有的inorder的组合，就相当于找出了所有的
binary tree
例如preorder是 4 2 1 3 6 5 7
我们知道4是root，那么可以把4插到任何一个地方，例如 2 1 3 4 6 5 7
那么2 1 3是左子树的元素，6,5,7是右子树的元素；2和6分别是左右子树的root
再分别对左右子树做操作，这样可以recursively求出所有的inorder
already
set |
|
k***t
发帖数: 276 | 44 看到一个题和一个答案。不太理解。
1.What does it mean that "tree representation is in Linked list format"?
Is there a standard way to represent a tree with a linked list? Or does it
just refer to the fact that TreeNode has left and right child link/pointers.
2. "When we thread a binary tree while doing preorder traversal, it wont
result in any cycle."
Is there a standard way to "thread' a binary tree? There is no "cycle"
concept at all in normal tree traversal, isn't it?
=======================================
S... 阅读全帖 |
|
S**I
发帖数: 15689 | 45 ☆─────────────────────────────────────☆
gzou (gzou) 于 (Thu May 12 02:26:35 2011, 美东) 提到:
马上就要G on site了，
求祝福。
下面是从本版收集到的Google的试题，便于大家查询。
申明：有的附带有解释说明的，也来自于本版或者网络，大家自己看， 不保证真确
http://www.mitbbs.com/article_t1/JobHunting/31847453_0_1.html
本人ECE fresh PhD，背景是电路/EDA，跟G业务基本没什么关系
同学内部推荐的，很简单的一次电面就给了onsite
题都不难，但是自己没把握好机会，出了一些小bug。
总的感觉，出错就是硬伤，宁可从最简单的算法写起，也不能出错。
电面：
1，Skip list， http://en.wikipedia.org/wiki/Skip_list
写code实现struct skip_list * find(struct skip_list *head, int value)
2，sorted array... 阅读全帖 |
|
S**I
发帖数: 15689 | 46 ☆─────────────────────────────────────☆
gzou (gzou) 于 (Thu May 12 02:26:35 2011, 美东) 提到:
马上就要G on site了，
求祝福。
下面是从本版收集到的Google的试题，便于大家查询。
申明：有的附带有解释说明的，也来自于本版或者网络，大家自己看， 不保证真确
http://www.mitbbs.com/article_t1/JobHunting/31847453_0_1.html
本人ECE fresh PhD，背景是电路/EDA，跟G业务基本没什么关系
同学内部推荐的，很简单的一次电面就给了onsite
题都不难，但是自己没把握好机会，出了一些小bug。
总的感觉，出错就是硬伤，宁可从最简单的算法写起，也不能出错。
电面：
1，Skip list， http://en.wikipedia.org/wiki/Skip_list
写code实现struct skip_list * find(struct skip_list *head, int value)
2，sorted array... 阅读全帖 |
|
f*********i
发帖数: 197 | 47 可以把两个树A,B分别preorder,inorder遍历
然后问题就变成
longest common string in preorder[A], preorder[B] => string 1
longest common string in inorder[A], inorder[B] => string 2
最后再次longest common string in string 1，string 2
如果全部用KMP来做，时间复杂度O(n) |
|
c**y
发帖数: 172 | 48 brutal force复杂度是比较高，但是如果有duplicate的话，只能用brutal force吧。
我只是不理解为什么CC150和我贴的论坛上说只用InOrder和PreOrder就可以了。上面那
个反例说明只用InOrder和PreOrder不够的。另外一个问题是InOrder,PreOrder和
PostOrder是不是就可以了呢（对于没有duplicate的元素）？ |
|
s*****1
发帖数: 134 | 49 我也觉得此题很莫名，如果null用特殊符号算的话，单用preorder就行了，我举不出单
用preorder的反例~似乎serialize 和 deserialize 也只用preorder~ |
|
