|
w*******y
发帖数: 60932 | 2 I can confirm the 3D Blu-ray player for $119 in this weeks Fry's ad is the
DMP-BDT210 from Panasonic. This player has wifi built-in and comes with a
voucher for a 3D blu-ray copy of Avatar. Given it's a Panasonic exclusive,
this blu-ray disc sells for $75+ on Ebay.
Only available in stores through Thursday, June 2nd.
Brief description:
Step into the 3D World. Watch 3D movies at home with Full HD 3D technology
with the DMP-BDT210.
FULL HD 3D Blu-ray Disc Playback
Advanced 2D image technology ac... 阅读全帖 |
|
w*******y
发帖数: 60932 | 3 Just wanted to share with all the canon fans on here...
Download on iTunes:
http://itunes.apple.com/us/app/canonsglens/id490527073
Official Canon "CanonSGLens" iOS App
January 3, 2012
Canon Software
Follow on our forum
58Share
Official Canon "CanonSGLens" iOS App
From Canon Singapore
In case you missed it in the holiday rush. Canon Singapore has released an
interactive reference iOS app for all Canon EF & EF-S lenses.
Description
CanonSGLens is a free Canon Singapore App that feature... 阅读全帖 |
|
w*******y
发帖数: 60932 | 4 Sears has this refrigerator with in door ice/water on sale Until Monday:
Kenmore 25.1 cu. ft. Side-by-Side Refrigerator w/ Ice/Water Dispenser
ENERGY STAR
Sears Item# 04651103000 | Model# 5110
Link:
http://iway.org/9632961
Dimensions and Capacity
Counter Depth: Standard Depth
Depth w/ Handle (In.): 34
Depth w/o Handle (In.): 31.25
Freezer Capacity (Cu Ft): 9.9
Height to Top of Case (In.): 68.87
Height to Top of Hinge (In.): 69.62
Overall Capacity (Cu Ft): 25.1
Refrigerator Capacity: 15.... 阅读全帖 |
|
k*****e
发帖数: 22013 | 5 【 以下文字转载自 ChinaNews 讨论区 】
发信人: pipigou123 (鼠姐虎弟), 信区: ChinaNews
标 题: Re: 在美国，学中医的比这里大部分人赚得多
发信站: BBS 未名空间站 (Sun Aug 14 19:55:23 2011, 美东)
INTRODUCTION — The word "acupuncture" is derived from the Latin words "acus
" (needle) and "punctura" (penetration). Acupuncture originated in China
approximately 2000 years ago and is one of the oldest medical procedures in
the world.
Over its long history and dissemination, acupuncture has diversified and
encompasses a large array of styles and techniques. ... 阅读全帖 |
|
c**i
发帖数: 6973 | 6 From a different perspective--China reaching new depth--on the same topic.
(1) Chen Xin, Submersible dives into ocean elite of nations. China Daily,
Aug. 27, 2010.
http://www.chinadaily.com.cn/china/2010-08/27/content_11210450.htm
Quote:
"A domestic submersible has reached a depth of 3,759 meters, making China
the fifth country in the world to acquire deep-diving technology surpassing
the 3,500-meter mark
" designed to reach a depth of 7,000 meters and operate in most of the world
's oceans * * |
|
t******r
发帖数: 8600 | 7 房产税难控房价看好刚需优质地产公司
凤凰网-1 hour ago
我们认为中国对住宅开征房产税的城市数量在未来3-5年会逐渐增加，但 ... 虽然我国
在保有环节房产税除沪渝两市外仅向商业用房征收，且在全部 ...
房产税开征最新消息
北京搜房-Jun 23, 2014
在房产税开征最新消息里，2014房产税开征时间成为群众广泛关注的问题。那2014年房
产税究竟会不会全面开征呢?房产税之所以受到广泛关注，主要是因为它被赋予 ...
卖地收入锐减地方征收房产税意
搜房-Jun 25, 2014
[摘要]日前，财政部部长楼继伟向全国人大常委会报告2013年中央决算时指出，下一步
将配合做好房产税立法相关工作。结合6月份国土部正式启动 ...
2014年房产税开征最新消息引各界质疑
搜房-Jun 26, 2014
目前2014房产税开征最新消息还是没有进行翔实阐述，有一些人认为：这是2014年的板
上钉钉的事，根据《房产税暂行条例》的相关规定，除家庭自住 ...
卖地收入锐减地方征收房产税意愿强烈
人民网-Jun 25, 2014
Explore in depth (107 more ar... 阅读全帖 |
|
发帖数: 1 | 8 Stone Cold Word
Longboat Key, Florida4m ago
AG Barr investigating a missing Twinkie is a joke.
So I am reading all these comments laughing and calling out "conspiracy
theories". It's easy to "throw shade"..... getting "shade to stick" is
another story.
I know this. A high profile prisoner, who supposedly tried to kill
himself just two weeks ago, this guy could not get near a 6 inch piece of
thread. Now that's not a "conspiracy theory".
The "shade slingers" want us to believe that this ego ... 阅读全帖 |
|
k**0
发帖数: 19737 | 9 很可惜，不能自动调节深度，否则一定能成为WWII潜艇杀手。
Upon water entry, FIDO performed a circular search at a predetermined depth
controlled by a bellows and pendulum system。
Initially the torpedoes were set to search for a target at a depth of 50
feet (15 m), this was later changed to 150 feet (45 m). To prevent the
torpedo accidentally attacking surface ships, it resumed its circling search
if it rose above a depth of 40 feet (12 m).
德国潜艇被攻击第一反映是紧急下潜到80米，VIIC型下潜入水只需要27秒。所以这种鱼
雷最适用的载具应该是飞机。
绩． |
|
m****s
发帖数: 8992 | 10 TIPS FOR DRIVING IN THE RAIN
Driving in the rain can be dangerous; in fact thousands of car accidents
each year are caused by wet driving conditions.
Routinely Check Your Tires
It is a good idea to always check your tires before you hit the road. To
ensure your tires are working at their best, make sure you do the following
routine maintenance:
Keep your tires properly inflated. The correct air pressure for your tires
is specified by the vehicle manufacturer and can be found on the vehicle
placa... 阅读全帖 |
|
w****i
发帖数: 233 | 11 一般轮胎都有30000~60000mile的warranty，是不是说：如果轮胎的remaining tread
depth小于或等于2/32in, 但是没有跑到这个warranty mile数，厂家或者销售商应该
refund一些credit啊？
还有这个2/32in 是不是应该是轮胎磨损最严重处的tread depth 而不是平均tread
depth？
谢谢牛人解答~！ |
|
e******g
发帖数: 5344 | 12 买了个tire thread depth gauge测了一下。
目前车子14700迈，前轮是8/32,后轮是7/32。
论坛是continental的，OEM的。
请问一下轮胎全新的时候depth是多少？还有根据depth啥时候应该rotate？
傻逼dealer在7500 迈的时候估计忘了rotate了，12000的时候发现前轮比后轮磨损严重
很多，于是去les schwab rotate了一下。
车是AWD的。多谢啦 |
|
发帖数: 1 | 13 googling "time to change tires"------
There are several popular ways to check your tire tread depth. One easy way
is the penny test. Simply insert a penny into your tire's tread groove with
Lincoln's head upside down and facing you. If you can see all of Lincoln's
head, your tread depth is less than 2/32 inch and it's time to replace your
tires.
Check Tire Tread Depth | Goodyear Auto Service Center
www.goodyearautoservice.com/content/content.jsp?pageName=TreadDepth
当然, 路況及个人驾驶习惯, 必须视作変数, 以作调整. |
|
m*****o
发帖数: 30 | 14 You searched for "financial & engineering". Your search returned 1231 matches.
Search Results Go to…
Lehigh University
Department of Industrial and Systems Engineering
Bethlehem, Pennsylvania
Description: In-depth Description of the Lehigh University.
Category: Peterson's > GradChannel > Graduate > In-Depth Description
Email this school
North Carolina State University
Program in Financial Mathematics
Raleigh, North Carolina
Description: In-depth Description of the North Carolina State Univer |
|
j**l
发帖数: 2911 | 15 这个使用了pair的思想就是把原本也可以用递归函数实现的count一棵子树的节点总数，放到逆中序遍历的递归函数里头，共享同一个递归过程。这个思想同样可以用来求depth, 进而可以用来求二叉树的直径。好处都是无须再单独定义一个递归的count节点的函数和一个递归的求最大depth的函数，也无须把额外的节点个数信息或者depth信息保存到节点数据里。
need
enough
. |
|
d*********i
发帖数: 628 | 16 先排序一遍生成2叉树
然后找到12，再找到24 《--用递归前序遍历
排序建立树时间是O(n)吧，不太确定
前序遍历worst case是要找的值在叶子上，
那O=depth of the tree:
worst case是每个点只有一个child,那depth = N
其他情况，depth = Log2(N) |
|
b********r
发帖数: 620 | 17 find depth of each node and the node with largest sum of left depth and
right depth is the one |
|
K*****k
发帖数: 430 | 18 定义直径为连通两节点最多的边数
空树和单节点树的直径都是0
直径有可能通过根节点，也可能通过某棵子树的根节点但不通过根节点。
利用经典的求二叉树高度的递归函数，同时保持直径的最大值，就可以了么？
// The initial value of diameter is set to 0
int Depth(Node* root, int& diameter)
{
if (root == NULL)
return 0;
int LDepth = Depth(root->left, diameter);
int RDepth = Depth(root->right, diameter);
if (LDepth + RDepth > diameter)
diameter = LDepth + RDepth;
return max(LDepth + 1, RDepth + 1);
} |
|
n**4
发帖数: 719 | 19 just a little practice
1) find the depth of a tree
struct node {
int val;
node * firstChild;
node * nextSibling;
}
int depth(node * tree) {
int maxDepth=0;
node * p;
if (tree==NULL) return 0;
p = tree->firstChild;
while (p) {
maxDepth = max(depth(p),maxDepth);
p=p->nextSibling;
}
return maxDepth;
}
// time complexity: O(N) N the node number of the tree
// space complexity: O(1)
2) check whether a linked list is circular or not.
struct node {
int val;
node * ne... 阅读全帖 |
|
m*****y
发帖数: 93 | 20 1. Compute the depth of its subtree on each node, using a recursive way.
2. For any node u, the length of longest path "turning at this node" is
depth(u->left) + depth(u->right) + 2. Therefore, for each node u, compute
the length and take the maximum one.
Both steps are O(n). |
|
m*****y
发帖数: 93 | 21 1. Compute the depth of its subtree on each node, using a recursive way.
2. For any node u, the length of longest path "turning at this node" is
depth(u->left) + depth(u->right) + 2. Therefore, for each node u, compute
the length and take the maximum one.
Both steps are O(n). |
|
l*********8
发帖数: 4642 | 22 我也写一个，写完才发现和jingoshine的是一样的：）
int BinaryTreeDepth(string & s)
{
int maxDepth(-1), depth(-1);
vector v;
for (int i=0; i
if (s[i] == '(') {
v.push_back(s[i]);
maxDepth = max(maxDepth, ++depth);
} else if (s[i] == '0') {
v.push_back('0');
} else if (s[i] == ')') {
int n=v.size();
if (n<3 || v[n-1]!='0' || v[n-2]!='0' || v[n-3]!='(')
return -1;
v[n-3] = '... 阅读全帖 |
|
l*****a
发帖数: 559 | 23 int maxPathSum(TreeNode *root) {
int d = 0;
return maxPathSum(root, d);
}
int maxPathSum(TreeNode *node, int &depth){
if(node == NULL){
depth = 0;
return INT_MIN;
}
int dl = 0;
int fl = maxPathSum(node->left, dl);
int dr = 0;
int fr = maxPathSum(node->right, dr);
int f = max(fl, max(fr, dl + node->val + dr));
depth = max(max(dl, dr) + node->val, 0);
retu... 阅读全帖 |
|
r****c
发帖数: 2585 | 24 给两个不同算法吧，就不写code了
1. 第一种，比较容易懂。longest path可能很多，但是所有longest path只有一个点
是largest depth from root，也就是tree depth。（用反证法来证明这个observation
）。先找任意一个叶子节点是largest distance from root，然后用这个点作为root，
找largest distance from root
2. 第二种，写程序比较方便，recursive，找到longest path AND largest depth of
the tree
say d(T) and L(T)
then d(T) = max (d(T->left), d(d-right))
L(T) = max( L(T->left), L(T->right), d(T->left) + d(T->Right) + 1) |
|
i**********e
发帖数: 1145 | 25 word ladder II 有人过了 large tests 吗？
我抛砖引玉一下吧，希望有大牛可以提出更好的解法。
思路就是按照 wwwyhx 的思路 backtrack 重建路径。昨晚写了一下，果然简洁很多，
整个程序不到50行。
基于程序可读性，所以 bottom up 返回路径，产生了很多不必要的拷贝而导致效率会
差很多。但路径组合没那么多，所以性能上也没什么影响。
typedef unordered_multimap Map;
typedef pair PairIter;
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
Map map, map2;
queue q, q2;
q.push(start);
bool goal = false;
while (!q.empty()) {
... 阅读全帖 |
|
i**********e
发帖数: 1145 | 26 word ladder II 有人过了 large tests 吗？
我抛砖引玉一下吧，希望有大牛可以提出更好的解法。
思路就是按照 wwwyhx 的思路 backtrack 重建路径。昨晚写了一下，果然简洁很多，
整个程序不到50行。
基于程序可读性，所以 bottom up 返回路径，产生了很多不必要的拷贝而导致效率会
差很多。但路径组合没那么多，所以性能上也没什么影响。
typedef unordered_multimap Map;
typedef pair PairIter;
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
Map map, map2;
queue q, q2;
q.push(start);
bool goal = false;
while (!q.empty()) {
... 阅读全帖 |
|
c********t
发帖数: 5706 | 27 用DFS实现print by level，我只会先求depth, 然后传level = depth to 1,到dfs函数
来打印。那样肯定不能做到O(n) 应该是 O(n*depth) worst case O(n^2) 也没那个
engineer说的那么离谱吧。你说的O(n)怎么做？
you |
|
c******a
发帖数: 789 | 28 3. http://www.geeksforgeeks.org/maximum-product-subarray/
4. 用Map暴力数出现的次数？这样做完全不scale，应该有更好的
办法。
5. bottom up，把”我以下“的depth recurse上去。对每个root，看left.depth+
right.depth+1是不是又大了。奇怪，这题我做过oj，leetcode真的没有？
6. address normalization. 哪个公司阿？这题没实际干过谁都要蒙吧。
7. BST展开吹吹就好
别的都不会做，遇到了一定死啦死啦的。 |
|
j********r
发帖数: 25 | 29 没有时间看你的是什么问题， 你参考一下如下程序吧：
int ladderLength(string start, string end, unordered_set &dict) {
int remaining = 1;
queue qou;
qou.push(start);
dict.erase(start);
int depth = 0;
while(qou.size() > 0) {
depth++;
int nextLevel = 0;
while(remaining >0) {
string s = qou.front();
qou.pop();
if (s == end) { return depth;}
... 阅读全帖 |
|
d********i
发帖数: 582 | 30 请问recursion下什么时候要用static? 谢谢。。
代码run还是不对，什么都没有。。。。
public static ArrayList combinationStarts(String s) {
ArrayList res = new ArrayList();
dfs(s.toCharArray(), res, 0);
return res;
}
public static void dfs(char[] sc, ArrayList res, int depth) {
if (depth == sc.length) {
res.add(new String(sc));
} else {
for (int i = depth; i < sc.length; i++) {
if (sc[i] == '*') {
sc[i] = '0';
dfs(sc, r... 阅读全帖 |
|
f******t
发帖数: 18 | 31 为什么都说还原＊号~我看楼主代码，每次循环是从0开始，如果加上还原星号会导致死
循环吧？应该还原是depth变量，楼主用static却从来不见depth有减的时候，这样当第
一次depth符合return条件之后，每次一进去递归就会返回 |
|
i***0
发帖数: 8469 | 32 想回国实现理想的大咖大牛看过来
博士毕业五年以上（或相关工作10年左右的）想回国的以下领域的大咖,大牛看过来，
我们提供给您国内首屈一指的互联网电商公司的高端职位。有理想，有抱负的您将得到
创业的环境和激情，却不用承担自住创业的各种风险，享受活力四射的工作氛围和令人
艳羡的回报，如果感兴趣请直接发简历或者详询p******[email protected]，来信必复。谢
谢关注！
岗位描述 1、Principal Engineer - Machine Learning
Responsibilities:
Innovation and optimization of core algorithms for online
advertising system
Applying machine learning to optimize advertising algorithms,
including:
Ad ranking
CTR prediction
Auto class... 阅读全帖 |
|
x*******9
发帖数: 138 | 33 nested_list = [[1,2], 1, [2, [2,1]]]
def revSum(nlist):
(depth, res) = dfs(nlist)
return res
def dfs(nlist):
nlist_sum = 0
s = 0
max_lv = 1
for item in nlist:
if isinstance(item, list):
(depth, res) = dfs(item)
nlist_sum += res
max_lv = max(max_lv, depth + 1)
else:
s += item
nlist_sum += s * max_lv
return (max_lv, nlist_sum)
print revSum(nested_list)
(已加入肯德基豪华午餐 |
|
x*******9
发帖数: 138 | 34 nested_list = [[1,2], 1, [2, [2,1]]]
def revSum(nlist):
(depth, res) = dfs(nlist)
return res
def dfs(nlist):
nlist_sum = 0
s = 0
max_lv = 1
for item in nlist:
if isinstance(item, list):
(depth, res) = dfs(item)
nlist_sum += res
max_lv = max(max_lv, depth + 1)
else:
s += item
nlist_sum += s * max_lv
return (max_lv, nlist_sum)
print revSum(nested_list)
(已加入肯德基豪华午餐 |
|
c******h
发帖数: 46 | 35 就是说 {1,2} 的weight 是1了对吧 因为nlist_sum没有乘max_lv
我觉得是对的
2L说{1,2} weight是2不知道为啥
nested_list = [[1,2], 1, [2, [2,1]]]
def revSum(nlist):
(depth, res) = dfs(nlist)
return res
def dfs(nlist):
nlist_sum = 0
s = 0
max_lv = 1
for item in nlist:
if isinstance(item, list):
(depth, res) = dfs(item)
nlist_sum += res
max_lv = max(max_lv, depth + 1)
else:
s += item
nlist_sum += s * max_lv
return (max_lv, nlist_sum)
p... 阅读全帖 |
|
I**********s
发帖数: 441 | 36 用queue.
int sum = 0;
queue > q;
q.push(pair(input, 1));
while (! q.empty()) {
List L = q.front().first;
int depth = q.front().second;
q.pop();
foreach (NestedInteger n : L) {
if (n.isInteger()) sum += n.getInteger() * depth;
else q.push(pair(n.getList(), depth+1));
}
}
return sum; |
|
I**********s
发帖数: 441 | 37 用queue.
int sum = 0;
queue > q;
q.push(pair(input, 1));
while (! q.empty()) {
List L = q.front().first;
int depth = q.front().second;
q.pop();
foreach (NestedInteger n : L) {
if (n.isInteger()) sum += n.getInteger() * depth;
else q.push(pair(n.getList(), depth+1));
}
}
return sum; |
|
s**********5
发帖数: 19 | 38 递归转iterative用stack
public int depthSum2 (List input){
Stack> nstack = new Stack<>();
Stack dstack = new Stack<>();
nstack.add(input);
dstack.add(1);
int total = 0;
while(nstack!=null){
int depth = dstack.pop();
for(NestedInteger i: nstack.pop()){
if(i.isInteger()){
total += i.getInteger()*depth;
} else{
dst... 阅读全帖 |
|
s**********g
发帖数: 14942 | 39 不是“错”吧
而是cannot terminate吧
你在
if (depth==0){
res.push_back(solution);
}
这里就该return了
否则depth变成负的，你的(n-depth+1) 超越n，永远跑不完 |
|
o****g
发帖数: 174 | 40 用的是这个wheel, 要先加载一个package scrapy.
https://github.com/LKI/wescraper
有如下错误：好像是没有得到cookie? 为什么?
[scrapy.utils.log] INFO: Scrapy 1.5.0 started (bot: scrapybot)
2018-01-23 17:51:22 [scrapy.utils.log] INFO: Versions: lxml 4.1.1.0, libxml2
2.9.7, cssselect 1.0.3, parsel 1.3.1, w3lib 1.18.0, Twisted 17.9.0, Python
2.7.13 |Anaconda 4.4.0 (64-bit)| (default, Dec 20 2016, 23:09:15) - [GCC 4.4
.7 20120313 (Red Hat 4.4.7-1)], pyOpenSSL 17.0.0 (OpenSSL 1.0.2l 25 May
2017), cryptography 1.8.1, Platform Linux-... 阅读全帖 |
|
J*****w
发帖数: 180 | 41 我朋友正在帮国内厂家物色有领导能力的，有创业精神的专家，在国内药厂组建蛋白质
药物开发部。
A leading China Pharma Company has immediate openings for the following four
leadership positions in its Yantai, China and Singapore sites. Please send
your resume to [email protected] if interested.
Title: Head, Upstream Process Development
Functional Description:
Lead, build and develop a high performance Upstream Process Development
group engaged in mammalian cell culture development for commercial
therapeutic proteins, including subclone/clone sel... 阅读全帖 |
|
b******y
发帖数: 1684 | 42 做了N多研究买的zephyr ak2100，结果发现柜子宽度合适，可是depth不够！
图纸上面，从rear screw的眼到底边有1 9/16"，
从front screw的眼到rear screw的眼是9 1/2"，
也就是说front screw的眼到底边有11 1/16"，还得加上螺丝钉滑动的1/4"。
可是柜子的depth只有11"，怎么也没法装啊。
原来用的那个破抽油烟机两个眼之间好像只有8"左右，轻松fit in.
现在这个zephyr看来要么就退回去，亏20% restocking fee，
要么买个木条钉柜子外沿来extend depth，不过又担心这个木头不够结实，
回头还得油漆这木条，很郁闷啊。 |
|
g*****9
发帖数: 4125 | 43 To me this is a must because good fridge (such as sub-zero) only comes in
counter depth, and only counter depth fridge can have face that match your
cabinet.
I like sub-zero the best, since they are counter depth, they do not hold as
much, so you need to buy the wider one if you want same volume inside. If
you can not go too wide in your kitchen, consdier adding a few undercount
ice maker, freezer and fridge to make up the space. Uline also makes good
under counter if you find sub-zero a little |
|
b*******c
发帖数: 20683 | 44 另外，好像一般的冰箱depth相差不大的，主要是width和height的尺寸不同，你嫌
depth太大没什么办法。counter depth的选择不多，又贵很多。 |
|
B********4
发帖数: 7156 | 45 不是你想象的那么难：
Repointing process
Sound mortar normally does not need to be removed from a building during the
repointing process, although such a practice is common. New mortar can be
designed to match the color and texture of existing mortar to avoid visual
aberrations. The repointing process begins by removing damaged pointing to a
depth equal to or slightly more than the width of the joint, or to the
point where sound mortar is reached. Depths greater than 2-1/2" or 4 cm
would be filled in sever... 阅读全帖 |
|
L**P
发帖数: 3792 | 46 24 inches are the standard depth for "counter-depth" refrigrator. Just buy
a "counter-depth" refrigrator. It will fit perfectl. |
|
j*****g
发帖数: 7513 | 47 家里旧的冰箱太小了，想买一个french door的。现在的问题是看上的冰箱
width:
35.625 inch,
Depth w/ Handle (in.):
35.438
Depth w/o Handle (in.):
32.938
Depth without Door (in.):
29.125
可是家的门宽才32 inch,其他都没有问题。
不懂过来问一下，冰箱运来门是安装好的还是进了门再安装的？如果是前者，那就没法
买这款了。
请有经验的同学指点，多谢！ |
|
|
|
d******8
发帖数: 1972 | 50 ABC News, Yahoo! News Announce Online Alliance
Yahoo! and ABC News announced a strategic online news alliance that will
blend ABC News' newsgathering and unrivaled lineup of trusted anchors and
reporters with Yahoo! News' unmatched audience, depth and breadth of content
. (Heidi Gutman/ABC)
Yahoo!, the premier digital media company, and ABC News today announced they
will join forces to launch a strategic online news alliance that will
deliver content to more than 100 million U.S. users each mont... 阅读全帖 |
|
