q***n
发帖数: 3594 | 1 5点5寸爱疯有，为啥10寸爱拍反而没有？平时习惯单手操作爱拍爱了，如果能有
reachability会方便很多啊。 |
|
q***n
发帖数: 3594 | 2 一直单手操作啊，爱拍放手心里，靠手掌握住，不要握太紧，让爱拍可以上下滑动。这
样大拇指可以够到一半的屏幕区域。如果有reachability的话，那就能够到85%了。。
男人单手操作爱拍会给人很潇洒利落的感觉。双手其实感觉很娘哎。 |
|
b**m
发帖数: 1466 | 3 其实是前几天有人问那个(10)的简化版：
public class Solution {
public boolean wordBreak(String s, Set dict) {
if(s.length()==0){
return dict.contains(s);
}
boolean[] reachable = new boolean[s.length()+1];
reachable[0] = true;
for(int i=0;i
if(!reachable[i]){
continue;
}
for(int j=i+1;j<=s.length();j++){
String e = s.substring(i,j);
if(dict.con... 阅读全帖 |
|
g*****x
发帖数: 799 | 4 // DP: f(n-1) = max{f(i)}, where i from n to n-1+a[n-1] and i
bool maze(const vector &vec)
{
if(vec.size() < 2)
return true;
vector reach(vec.size(), false); // reachability of the nth pos to
the last pos
reach[reach.size() - 1] = true; // last position is always reachable to
itself
for(int i = reach.size() - 2; i >= 0; --i)
{
for(int j = i + 1; j <= i + vec[i] && j < reach.size(); ++j)
if(reach[j] == true)
{
... 阅读全帖 |
|
g*****x
发帖数: 799 | 5 // DP: f(n-1) = max{f(i)}, where i from n to n-1+a[n-1] and i
bool maze(const vector &vec)
{
if(vec.size() < 2)
return true;
vector reach(vec.size(), false); // reachability of the nth pos to
the last pos
reach[reach.size() - 1] = true; // last position is always reachable to
itself
for(int i = reach.size() - 2; i >= 0; --i)
{
for(int j = i + 1; j <= i + vec[i] && j < reach.size(); ++j)
if(reach[j] == true)
{
... 阅读全帖 |
|
z*****u
发帖数: 51 | 6 哈，我加个snapchat的电面面经吧。
题目很完整，国人大哥面的。
/*
Consider a grid where all the points are represented by integers.
.........................................
...(-2,2) (-1,2) (0,2) (1,2) (2,2)...
...(-2,1) (-1,1) (0,1) (1,1) (2,1)...
...(-2,0) (-1,0) (0,0) (1,0) (2,0)...
...(-2,-1) (-1,-1) (0,-1) (1,-1) (2,-1)...
...(-2,-2) (-1,-2) (0,-2) (1,-2) (2,-2)...
..........................................
k-Snap point: A point whose digits sum up to less than or equal to k. In
this question, we... 阅读全帖 |
|
I**A
发帖数: 2345 | 7 hmm, we should ask the interviewer about how to define reachable..
based on your cents, then a[j+3] can only be reached by a[i+2} since it does
not have a up node, right?
could you please describe how you can get a node's reachable up nodes?
thanks..
given a index i, find its one or two or three reachable up node.. |
|
m***n
发帖数: 2154 | 8 来自主题: JobHunting版 - 这题咋做？ 创建一个
int n = maze.length;
boolean reachable[] = new boolean[n];
int current_cursor = 0;
while(current_cursor
{
if(reachable[current_cursor]) {
for(int i=1;i<=maze[current_cursor];i++) {
if(current_cursor+i>=n-1)
return true;
reachable[current_cursor+i] = true;
}
}
current_cursor++;
}
... 阅读全帖 |
|
h*****f
发帖数: 248 | 9 smalleye's solution is better...
in case anyone wants a dp version (from front to back):
int compute(int a[], int length) {
int b[length];
int max = std::numeric_limits::max();
for (int i = 0; i < length; i++) b[i] = -1; // not reachable
b[0] = 0; // first one is alway reachable
for (int i = 0; i < length; i++) {
if (b[i] >= 0) {
// only try if the current index is reachable
for (int j = i + 1; j <= i + a[i] && j < length; j++) {
... 阅读全帖 |
|
h*****f
发帖数: 248 | 10 smalleye's solution is better...
in case anyone wants a dp version (from front to back):
int compute(int a[], int length) {
int b[length];
int max = std::numeric_limits::max();
for (int i = 0; i < length; i++) b[i] = -1; // not reachable
b[0] = 0; // first one is alway reachable
for (int i = 0; i < length; i++) {
if (b[i] >= 0) {
// only try if the current index is reachable
for (int j = i + 1; j <= i + a[i] && j < length; j++) {
... 阅读全帖 |
|
k**********g
发帖数: 989 | 11
..
Yes, sort of.
The essence of this problem is to answer the question: "when is it safe to
permanently delete something".
If you answer is: "it is safe to delete it if it is theoretically impossible
to cause a problem by deleting it", then your answer is essentially what is
known as "reachability". Something that is not reachable is like
Schrodinger's cat; nobody knows if it is dead or alive.
I can think of three approaches. The first two are practical; the third one
is too advanced to be impl... 阅读全帖 |
|
b***e
发帖数: 1419 | 12 Seems it's just a queue construct starting from the super set of roots. For
your example, start with:
{{}|{a,b}, {a}|{b}, {b}|{a}, {a,b}|{}}
Note we use S1|S2 to denote a state where the nodes in S1 must appear and
nodes in S2 must not appear in any future extension.
Pop {}|{a,b}. You can not reach more with empty starting set, so this is it.
Pop {a}|{b}, which means a is in and b is out. This state only reaches {a,c
}|{b}, so we push that in.
Pop {b}|{a}. This state doesn't reach anywhere, ... 阅读全帖 |
|
t******l
发帖数: 10908 | 13 有比 smallest decision tree 不费体力的解法。计算 Lowest bound,然后证明该
bound 是 reachable.
Lowest bound 是 max(m, n)，因为每个套套有两个 surface。。。然后证明
reachable 稍微复杂一点。。。。
这样可以算 AMC12 应该 |
|
t******l
发帖数: 10908 | 14 3 男 1 女，好像两个套套就够了，这个 (m+n+1)/2 （整数除法）的 lowest bound 好
像 reachable。
具体证明可以 contruct 一个 fucking graph maintain lowest bound，然后证明该
fucking graph reachable? |
|
l****z
发帖数: 29846 | 15 By 2:1, CA Voters Back Death Penalty:
61% of registered voters from the state of California say they would vote to
keep the death penalty, should a death penalty initiative appear on the
November 2012 ballot, according to this latest SurveyUSA poll conducted
exclusively for KGTV-TV San Diego, KPIX-TV San Francisco, KFSN-TV Fresno,
and KABC-TV Los Angeles. 29% say they would vote to eliminate the death
penalty. Keeping the death penalty law in California is supported by a
majority among all group... 阅读全帖 |
|
I**A
发帖数: 2345 | 16 Given an array of integers. Imagine it as a pyramid as below:
a[]={1,2,3,4,5,6,7,8,9,10}
1
2 3
4 5 6
7 8 9 10
find a path from level 1 to last level such that the sum is maximum. The
path is such that its children should be reachable.
Ex:
1,2,5,9 is a path
1,2,6,10 is not a path since 6 is not reachable from 2.
The array is not sorted and numbers are random. |
|
l*********3
发帖数: 26 | 17 1. Maze Problem
set the farest reachable position, Max = 0;
cur = 0;
while ( cur <= Max )
do
if ( cur + Maze[cur] > Max )
Max = cur + Maze[cur];
if ( Max >= length(Maze-1) )
return reachable;
cur++;
endwhile
return unreachable;
The time complexity is O(N).
2. Popular 3-hit problem:
Build two hash tables, the first Hc for the customers, the second Hp for
the 3-hit links.
Scan the hitting records, adding the hit reco... 阅读全帖 |
|
i**********e
发帖数: 1145 | 18 It is O(N) --
The inner loop find across a section which is all reachable in x steps, and
find the maximum that it can reach in the next iteration.
Then the next iteration start by searching for section which is all
reachable in x+1 steps. The search starting point is at (reach+1), which is
the point after the section it just searched.
The outer loop basically test if it has reached the destination. |
|
A**u
发帖数: 2458 | 19 网上看到的，不知道是不是面是题目
写一段程序判定一个有向图G中节点w是否从节点v可达。（假如G中存在一条从v至w的路
径就说节点w是从v可达的）
。以下算法是用C 写成的，在bool Reachable函数中，你可以写出自己的算法。
class Graph{
public:
int NumberOfNodes();//返回节点的总数
bool HasEdge(int u,int v);//u,v是节点个数，从零开始依次递增，当有一条从u到v
的边时，返回true
}；
bool Reachable(Graph&G, int v, int w)
如果象迷宫一样，可以标记，还好做 back keeping
但这个题目没发标记已经走过的node
改怎么写代码呢 |
|
i*****g
发帖数: 2564 | 20 That tower is reachable by car.
You need to pick a mountain top that is reachable by hiking/climbing only to
make it fair for both panda and the girl. |
|
i*****g
发帖数: 2564 | 21 Tanger has a large selection as well but probably missing a few of the top
names that Woodbury has. However, it has 2 locations on Long Island (Deer
Park - reachable by LIRR and shuttle vs. Riverhead - reachable by bus from
Flushing). Both are closer to Flushing (Deer Park is only 30-40 minutes by
car) than Woodbury. Note: if you are shopping for kids, the Deer Park one
has more selection.
For savings on either one, go to their websites to print the coupons. If
you are a AAA member, tanger w... 阅读全帖 |
|
m*********D
发帖数: 1727 | 22
呵呵，儿子的私校申请结果要等到月底。有没有选择还不知道呢。我的任务就是钱到位
。所以，还得再工作上加点紧，让老板再搞一个grant,我就不用去walmart打工给他挣
学费了。昨天翻除十年钱些得旧文，陪女儿走过大学申请。。。
日子过得真快
昨天接到女儿的伊妹儿，通知我四月份回来参加高中毕业十年的同学聚会。。。十年啊
，我中间失业一次，头发白了不少，儿子也到了上大学的时候，上个月我也终于达到了
政府规定的早退休的最起码的要求。。。
昨天终于把折腾了六个月的一个难题解决了。数据交给老板: 经费申请就看你的了。我
的bench work--development完成了。。。再拿一个grant,我就不用去Walmart给儿子挣
学费了。美好的一天，吃完中饭可以去校园里散步一小时。。。
翻出十年前女儿大学申请的总结，记忆犹新啊!
女儿大学申请过程中父母的心路历程 下一
（终于陪女儿走完了她人生的重要一步－－大学申请。生活中和网上的朋友催了好一阵
子，让俺写一个体会和总结，让他们有机会了解一些这个看似“神秘”的过程。好吧，
俺就把俺自己在这个过程中的一些做法和想法写出来，希望朋友们从我们失... 阅读全帖 |
|
m*********D
发帖数: 1727 | 23
呵呵，儿子的私校申请结果要等到月底。有没有选择还不知道呢。我的任务就是钱到位
。所以，还得再工作上加点紧，让老板再搞一个grant,我就不用去walmart打工给他挣
学费了。昨天翻除十年钱些得旧文，陪女儿走过大学申请。。。
日子过得真快
昨天接到女儿的伊妹儿，通知我四月份回来参加高中毕业十年的同学聚会。。。十年啊
，我中间失业一次，头发白了不少，儿子也到了上大学的时候，上个月我也终于达到了
政府规定的早退休的最起码的要求。。。
昨天终于把折腾了六个月的一个难题解决了。数据交给老板: 经费申请就看你的了。我
的bench work--development完成了。。。再拿一个grant,我就不用去Walmart给儿子挣
学费了。美好的一天，吃完中饭可以去校园里散步一小时。。。
翻出十年前女儿大学申请的总结，记忆犹新啊!
女儿大学申请过程中父母的心路历程 下一
（终于陪女儿走完了她人生的重要一步－－大学申请。生活中和网上的朋友催了好一阵
子，让俺写一个体会和总结，让他们有机会了解一些这个看似“神秘”的过程。好吧，
俺就把俺自己在这个过程中的一些做法和想法写出来，希望朋友们从我们失... 阅读全帖 |
|
h******u
发帖数: 155 | 24 1. Java memory leak不是真正techincal的memory leak（类似于 C/C++），并不是说
GC没有办法回收memory，而是很多时候programmer忘记及时release reference,以至于
不会再用的object还被 hold，所以导致GC无法 回收
2. GC工作原理是 reachability，一个object能不能被回收，完全决定于它是不是能从
一些roots 到达 （static fields, stack vars），如果没有办法到达，就是
unreachable了，就被回收掉了。但是如果原来 a.f reference在b, 你用完b，忘了把a
.f = null，b就一直reachable，一直没有办法被释放
3. String其实是一个很大的问题，通常会导致java 里面严重的memory问题。eclipse
里面的很多performance 问题实际上可以通过有效的strong 操作很好的避免。具体可
以看一下这些 tips
http://wiki.eclipse.org/Performance_Bloopers |
|
f*****m
发帖数: 416 | 25 相对于neighbor solicitation message interval, neighbor reachable time 设的不
够大?
1. 把neighbor reachable time 设大一点,譬如3倍neighbor solicitation message
interval
2. 或者 static ipv6 neighbor |
|
W******c
发帖数: 23 | 26 151. How are the elements of a GridLayout organized?
The elements of a GridBad layout are of equal size and are
laid out using the squares of a grid.
152. What an I/O filter?
An I/O filter is an object that reads from one stream and
writes to another, usually altering the data in some way as
it is passed from one stream to another.
153. If an object is garbage collected, can it become
reachable again?
Once an object is garbage collected, it ceases to exist. It
can no longer become reachable aga |
|
m******t
发帖数: 2416 | 27
Wow, wow, hold there a min. Let's be careful - "multiple dimension arrays"
and "network/database connections" are totally different in this context.
Releasing connections or any other system resources *other than* memory
is not only good style but actually mandatory.
But arrays that are merelly heap blocks? that's a different story.
intensive
time
If an object is reachable from some other object, that "reacher" object needs
to
maintain it. If an object only needs to be reachable during one op |
|
F****n
发帖数: 3271 | 28
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The first problem is indeed a trap. Normally in my application I use
TreeModel.addListener(Listener listener, int RefType)
to explicitly declare the listener's reference type, and set
TreeModel.addListener(Listener listener) to use hard reference.
You second problem is not a problem because if the listener becomes weakly
reachable (nobody reference it), then its reference to the tree will become
weakly reachable too if the tree does not have oth |
|
p***o
发帖数: 1252 | 29 It's a problem of reachability. Either you show it's reachable or
prove it's not. For the simple case of 9 boxes, there are only 9!
vertices in the graph so brute-force search will work. Otherwise
you need some heuristics like a* search. |
|
v******n
发帖数: 421 | 30 问题里面的A是B的祖先，是不是指从A可以到达B？就是reachability query。
简单实现的transitive closure是O(n^2) space，O(1) query time
dynamic reachability query应该有很多paper吧 |
|
l******s
发帖数: 3045 | 31 来自主题: Programming版 - 出道面试题 I was in a telephone and listen to all to get the problem. There wasn't text
descriptions and samples, and function input needs you define it, so I
started in this way.
I was waiting for your questions just like how the interview worked. Now I
am adding a few samples below:
1) stone list 0, 1, 3, 5, 6, 8, 12, 17 is reachable, the frog is jumping
from stone 0 with +1 speed, it goes to stone 1, then +1 it goes to stone 3,
then keep same speed to go to stone 5, and so on, after trying all
possibili... 阅读全帖 |
|
o***s
发帖数: 42149 | 32 吴尊出生于文莱，他从小学习篮球，并担任过文莱国家队队员；此外，他还代表过文莱与中国的少年队交手，并与姚明一起切磋过。吴尊16岁时，前往澳洲读书，并拿到了澳大利亚皇家墨尔本理工大学工商管理学士学位。在16岁时就和自己的高中同学林丽莹在交往，并且生出了这么可爱的neinei和max。网友称：林丽莹上辈子修来这么好的福分，能嫁给这么帅气的吴尊！
之前带着女儿neinei参加《爸爸回来了》的录制，以及现在正在热播的《爸爸去哪儿》，吴尊奶爸都会穿上那件对女儿未来男朋友的十大准则。这不最新一期还把这件衣服送给刘耕宏呢？
吴尊送给刘畊宏的衣服后面的十大准则分别是：
1 get a job and be a responsible person
1 有工作，负责任
2 understand i mignt not like you
2 理解我可能不喜欢你
3 I am spying on you anytime,anywhere.
3 我会随时随地监督你
4 You hurt her,I hurt you twice as much.
4 如果你敢伤害我的女儿，我会加倍奉还
5 Be reachabl... 阅读全帖 |
|
s*****5
发帖数: 31 | 33 English channel carved by huge ancient flood
Ian Sample, science correspondent
Wednesday 18 July 2007 09.26 EDT
A cataclysmic flood cleaved Britain from France hundreds of thousand years
ago, in a violent act of nature that carved out the white cliffs of Dover
and set the course of history for a new island.
High-resolution sonar images of the English channel collected over more than
20 years have revealed a deep scar in the seabed that was ripped from the
limestone bedrock by a torrent of water ... 阅读全帖 |
|
f***s
发帖数: 799 | 34 PayPal cuts WikiLeaks from money flow
BERLIN (AP) -- The online payment service provider PayPal has cut off the
account used by WikiLeaks to collect donations, serving another blow to the
organization just as it was struggling to keep its website accessible after
an American company stopped directing traffic to it.
PayPal said in a blog posting that the move was prompted by a violation of
its policy, "which states that our payment service cannot be used for any
activities that encourage, promote... 阅读全帖 |
|
w********t
发帖数: 12853 | 35 本月刚刚心脏病去世的 Omar Ahmad, San Carlos 市长。
Mayor dies of heart attack: San Carlos colleagues shocked at Omar Ahmad’s
sudden death
May 11, 2011, 04:02 AM By Michelle Durand Daily Journal Staff
Andrew Scheiner/Daily Journal
San Carlos Mayor Omar Ahmad died of a heart attack Tuesday.
San Carlos Mayor Omar Ahmad, known for his humor and long history with
Silicon Valley ventures as much as his civic duty, died early Tuesday
morning of a heart attack at age 46.
The news left City Hall shocked, with the f... 阅读全帖 |
|
w***n
发帖数: 766 | 36 depends on how much fuel the aircraft is carrying
south pole not reachable when it was loaded with ~7 hours of fuel. |
|
发帖数: 1 | 37 【 以下文字转载自 USANews 讨论区 】
发信人: rival (sss), 信区: USANews
标 题: 今天和个美国人聊天谈到trump儿子
发信站: BBS 未名空间站 (Sat Mar 12 19:59:21 2016, 美东)
娃打球时候聊到大选，他在金融界工作，有个好朋友和trump的2个儿子有来往，听了不
少关于trump儿子的事情。
他说“trump两个儿子不光是有礼貌有教养，而且是很reachable的人，不会让你觉的他
们是高高在上的，你家娃如果和他家娃一起活动，他们就是普通的爸爸，也和大家谈笑
风生，不像诸如肯尼迪家族之类的”。毫无疑问，他是打算投trump了。
我对trump有保留，上面就算给trump粉丝们一点宣传素材吧。 |
|
G*******n
发帖数: 6889 | 38 什么星球的“美国人”，approachable和reachable的区别分不清？ |
|
t******l
发帖数: 10908 | 39 Lowest bound 应该是 (m+n+1)/2 （整数除法），这个不知道是不是 reachable。 |
|
w********2
发帖数: 632 | 40 IPMI: The most dangerous protocol you've never heard of
IPMI could be punching holes in your corporate defenses.
Paul F. Roberts By Paul F. Roberts
ITworld | AUGUST 19, 2013
MORE GOOD READS
Many servers expose insecure out-of-band management interfaces to the
Internet
Those 'invisible' servers could open your network to hackers
Despite patches, Supermicro's IPMI firmware is far from secure, researchers
say
screen shot 2018 09 21 at 10.43.22 am
DEALPOSTS
Apple's dropping Back To My M... 阅读全帖 |
|
W*******n
发帖数: 4140 | 41 Limin Wang
136-09 59th Ave
Flushing, NY 11355
Oct. 1, 2019, Tue
State of New York
Workers’ Compensation Board
PO Box 5205
Binghamton, NY 13902-5205
WCB Case #: G2029240
WC Insurance Carrier Case #: 18D48F512440
Date of Injuries: Jan. 16, 2018
Employer: B.Q. Wide Auto Body Parts Supply, Inc.; KSI Trading Corp; TriNet/
Strategic Outsourcing Inc.
Stated Insurance Carrier: Indemnity Insurance (Co) of North America
Third Party Administrator: Cannon Cochran Management Services, Inc. (CCMSI)
Re: Rebut ... 阅读全帖 |
|
C***U
发帖数: 6529 | 42
我说的资源，是指那些好的学校啦、老师啦什么的。还有，小地方什么都是reachable
的，大城市单单开车接送都耗时无数啊。 |
|
V*****8
发帖数: 33122 | 43 啊难道不是大城市选择的余地更多吗，学校啊老师啊这些。公共交通也更完善，就和国
内一样。
reachable |
|
l*******g
发帖数: 28502 | 44 学校老师就更不用说了，小地方你上哪找个中文学校。
reachable |
|
R***h
发帖数: 2589 | 45 富豪的阿帕门
我的朋友们都开玩笑叫我富豪，其实我不是，我只是一个仍在为今后能有大豪宅和美女
老婆苦苦奋斗的屌丝。不过，我毫不夸张地说我是一个很有理想也很有品味的屌丝，只
要你来看过我的阿帕门就知道了。
我的阿帕门400 sq ft，1BR+1BATH，经过我的精心布置，它看起来一点都不小。首先我
买了个study full bunk bed，这样就把computer table的地方省出来了。我告诉你们
，在bunk bed下干活效率特别高，空间不大不小，对着墙，不容易被别的事情分心。我
买的是钢架的，结实。木头的过了一段时间会有吱吱声，不适合我这样的大个子，更不
适合两人上床。
紧靠着bunk bed是书架，很高的那种，也是金属的，match床的风格。书架上不全用来
放书，还放一些照片和装饰品，书架顶是仿真的植物和花，恰到好处地给房间增添些绿
色和生气。
与bunk bed并排的是entertainment center，我的电视、Wii、compact PC和speaker
system都在上头。面对着entertainment center的是宜家的chaise lounge，旁... 阅读全帖 |
|
l****z
发帖数: 29846 | 46 BEIJING—Chinese officials have indicted Gu Kailai, the wife of fallen
Chinese politician Bo Xilai, on the charge of intentional homicide, state
media reported on Thursday.
The state-run Xinhua news agency said Ms. Gu was prosecuted by officials in
China's Anhui province. Xinhua also said a person named Zhang Xiaojun had
been charged, without providing further identification.
Chinese officials have previously said Ms. Gu and an employee in the Bo
household were suspects in the death of British bu... 阅读全帖 |
|
S**C
发帖数: 2964 | 47 So your wealth accumulated in year 2013 and before do not need to be
protected in 2014? I wish we can invent some safe-box in parallel universe
that can only reachable by ourselves.
gain
name?
tax
him |
|
r***l
发帖数: 9084 | 48 娃打球时候聊到大选，他在金融界工作，有个好朋友和trump的2个儿子有来往，听了不
少关于trump儿子的事情。
他说“trump两个儿子不光是有礼貌有教养，而且是很reachable的人，不会让你觉的他
们是高高在上的，你家娃如果和他家娃一起活动，他们就是普通的爸爸，也和大家谈笑
风生，不像诸如肯尼迪家族之类的”。毫无疑问，他是打算投trump了。
我对trump有保留，上面就算给trump粉丝们一点宣传素材吧。 |
|
t******r
发帖数: 8600 | 49 【 以下文字转载自 Military 讨论区 】
发信人: guofeng (中国风), 信区: Military
标 题: CNBC: 谷歌对华为终止部分服务
发信站: BBS 未名空间站 (Sun May 19 15:24:51 2019, 美东)
Alphabet’s Google has suspended business with Huawei that requires the
transfer of hardware and software products except those covered by open
source licenses, a source close to the matter told Reuters on Sunday, in a
blow to the Chinese technology company that the U.S. government has sought
to blacklist around the world.
Huawei Technologies will immediately lose access... 阅读全帖 |
|
