B******l
发帖数: 262 | 1 12.4 Imagine you have an unbalanced binary search tree. Design an algorithm
which creates a linked list of all the nodes at each depth (eg, if you have
a tree with depth D, you’ll have D linked lists).
答案如下:
struct LLNode {
LLNode(Node* t, LLNode* n) : next(n), tree(t) {}
LLNode* next;
Node* tree;
};
struct ListOfLists {
ListOfLists() : next(NULL), data(NULL) {}
ListOfLists* next;
LLNode* data;
};
ListOfLists* TreeLinkedLists(Node* root) {
ListOfLists* results = new ListOfLists();
... 阅读全帖 |
|
s*****n
发帖数: 994 | 2 不知道什么地方可以改进？请有时间的朋友指点一下
combinationsum1用类似的办法就没超时
class Solution {
public:
vector > combinationSum2(vector &num, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
sort (num.begin(), num.end());
vector > results(0);
addOneBit(num, target, results);
return results;
}
void addOneBit (vector &num, int target, vector > &
results){
if (target =... 阅读全帖 |
|
v*******n
发帖数: 41 | 3 public class Solution {
public ArrayList insert(ArrayList intervals,
Interval newInterval) {
// Start typing your Java solution below
// DO NOT write main() function
ArrayList result = new ArrayList();
if(intervals.size() == 0){
result.add(newInterval);
return result;
}
for(Interval item:intervals){
if(item.end < newInterval.start){
result.add(item);
... 阅读全帖 |
|
i*********n
发帖数: 58 | 4 vector uglyNumber(int n) {
vector result(1, 1);
int index2 = 0;
int index3 = 0;
int index5 = 0;
/// Next ugly number, first is 1, already in result
for(int i = 1; i < n; i ++) {
int next = std::min(result[index2] * 2,
std::min(result[index3] * 3, result[index5] * 5));
result.push_back(next);
while(result[index2] * 2 <= result[i]) index2 ++;
while(result[index3] * 3 <= result[i]) index3 ++;
while(result[in... 阅读全帖 |
|
g****v
发帖数: 971 | 5 Read N Characters Given Read4 II - Call multiple times
测试的输出是：
Input: "ab", [read(0),read(1),read(2),read(1)]
Output: ["","a","b","b"]
Expected: ["","a","b",""]
我的思路很简单，就是把上次没读完的保留下来（并且是把没读完的字符移动到index
0）. 下次读的时候先读上次剩下的。但不知道为什么不对？
class Solution {
int left = 0; //length of left chars of last time reading, staring from
0 of leftover.
char leftover[4];//left chars are stored here.
public:
/**
* @param buf Destination buffer
* @param n Maximum number of characters t... 阅读全帖 |
|
t******t
发帖数: 121 | 6 Baidu Announces Fourth Quarter and Fiscal Year 2010 Results 01/31 04:
30 PM
BEIJING, Jan. 31, 2011 /PRNewswire-Asia/ -- Baidu, Inc. (BIDU:$108.63,00$2.
09,001.96%) , the leading Chinese language Internet search provider, today
announced its unaudited financial results for the fourth quarter and fiscal
year ended December 31, 2010(1).
(Logo: http://photos.prnewswire.com/prnh/20081103/BAIDULOGO)
Fourth Quarter and Fiscal Year 2010 Highlights
Total revenues in the fourth quarter of 2010 were ... 阅读全帖 |
|
b****n
发帖数: 8 | 7 Address:
Email:
Cell phone:
Work phone:
Oct 28, 2013
Department of Homeland Security
USCIS Nebraska Service Center
P.O. Box 87103
Lincoln, NE 68501-7103
I-140 Immigration Visa Petition Under First Preference EB-1
Petitioner/Beneficiary: XX Z., Ph.D.
Category of Petition: Alien of Extraordinary Ability
Classification Sought: 203(b)(1)(A)
Nature of Submission: Original Submission
Dear Immigration Officer,
This letter is respectfully submitted in s... 阅读全帖 |
|
b****n
发帖数: 8 | 8 Address:
Email:
Cell phone:
Work phone:
Oct 28, 2013
Department of Homeland Security
USCIS Nebraska Service Center
P.O. Box 87103
Lincoln, NE 68501-7103
I-140 Immigration Visa Petition Under First Preference EB-1
Petitioner/Beneficiary: XX Z., Ph.D.
Category of Petition: Alien of Extraordinary Ability
Classification Sought: 203(b)(1)(A)
Nature of Submission: Original Submission
Dear Immigration Officer,
This letter is respectfully submitted in s... 阅读全帖 |
|
c**l
发帖数: 9003 | 9 场地看着不错。。。另外袜子和鞋的颜色的要配
http://www.teamusa.org/USA-Table-Tennis/Ratings/How-Does-the-US
The ‘Matchpoint’ Ratings Processing System
USA Table Tennis player ratings are processed by North American Table Tennis
(NATT) as a contracted service. NATT uses proprietary software called ‘
Matchpoint’ to process the ratings in a manner consistent with the rules
established by USA Table Tennis. Matchpoint is integrated with the USATT
membership system.
Tournaments are processed in chronological order. Late ... 阅读全帖 |
|
w********1
发帖数: 3492 | 10 Fri, 29 Jun 2012 08:23:20 PDT
In what should not be a surprise given Siri's beta status and its use of new
technology for voice interaction with mobile devices, a study from Piper
Jaffray analyst Gene Munster finds that Siri's abilities are still eclipsed
by the traditional text-entry Google searches that have been in place for
years.
The study included presenting Siri with 800 queries in each of two
environments, a quiet room and a busy urban street, and then assessing Siri'
s ability to correc... 阅读全帖 |
|
o********e
发帖数: 474 | 11 最近也不知道干了点啥，一开机总是出现提示蓝牙驱动找不着。
见图。自动网络寻找和本地都找不到驱动，况且我根本不知道这两个找不着驱动的设备
/服务是啥！disable或者是uninstall这两个，下次开机或者刷新下就又出来了！看着
很烦！
系统是windows 7 Ultimate 64 bit, thinkpad x201
网上找了一通类似问题，很多人提到要装个windows mobile device center.
于是就去MS网上下。
http://www.microsoft.com/en-us/download/details.aspx?id=3182
可是下不来！！！！
要想下载那个先要下个GeniuneCheck.exe检查正版，我是正版我不怕阿，可是他妈
这个GeniuneCheck.exe根本运行不了！！！说是"This version of the Windows
Genuine Advantage validation tool is no longer supported. Please download
the newest version and ensure... 阅读全帖 |
|
z**********r
发帖数: 86 | 12 我现在在学习Java，以前会C/C++，但是主要是用C和Matlab。
我用的是Weiss "Data Structures and Problem Solving Using Java 3rd Edition"，
现在看到了第四章，关于继承。
里面有一道习题（4.23）：
Write generic method max2, which accepts an array and return an array of
length two representing the two largest item in the array. The input array
should be unchanged. Then use this method on String type.
最下面是我的代码。现在我的问题是，我知道创建一个generic array是不被允许的。
StackOverflow上面有人给了一种方法：
AnyType []result=(AnyType []) new Object[2];
这种方法编译没有错的，但是运行的时候会出现[Ljava.lang.Object; ... 阅读全帖 |
|
y****e
发帖数: 23939 | 13 I paste the full code to if anybody can help me out.
the function refalifn and refalifnfast are good to compile on vc++.
But the function refalidf and refalifdf will have this LNK2019 error on vc++
. Same code compiles OK on g++. It must be some kind of restraint with
visual c++.
static double refalifn(const gsl_vector * v, void *params)
{
Dict *dict = (Dict *) params;
double x = gsl_vector_get(v, 0);
double y = gsl_vector_get(v, 1);
double a = gsl_vector_get(v, 2);
EMData *t... 阅读全帖 |
|
z*t
发帖数: 863 | 14 Beutler得奖，Medzhitov会不会有意见？
http://www.sciencedirect.com/science/article/pii/S1074761309002
Ruslan Medzhitov
This year marks the 20th anniversary of a publication (Janeway, 1989) that
in many ways revolutionized our understanding of the immune system. As part
of the proceedings of the Cold Spring Harbor Symposium on Immune Recognition
, the paper authored by the late Charles A. Janeway, Jr. was not a standard
peer-reviewed publication. In fact, Charlie used to refer to it as “the
best paper I've ... 阅读全帖 |
|
i*****s
发帖数: 4596 | 15 有一个不怎么准确的译文，不过可读性倒是不低，我把原文附在后面：
祖神来归式科学
费曼（Richard Feynman）
在中世纪，有各种类型的古怪观念，如象一块犀牛角会增强权力。后来找到一种方
法将各种观念进行分类 --- 行得通就弄明白它，行不通就取消它。尔后，这种方法
就逐步形成科学。而且它发展得很好，所以我们现在是处在科学的时代。然而使我
们很难理解的是，就在这样一个科学时代巫医怎么会存在，巫医提出的事，从没有
真正行得通 --- 或者很少行得通。
但是时至今日，我遇到不少人，他们总会和我说到飞碟（UFO），或者星相学，或者
某些神秘主义，扩大的知觉，新型意识，超感觉力，等等。我得到结论，这都不属
于科学世界。
许多人相信那些荒诞不经的事物，使得我决意研究他们为什么这样。我的好奇心促
使我去进行研究，而所涉及到的内容却使我陷入困境。居然有这么多糟粕，真使人
吃惊。首先我由研究神秘主义，神秘经验的各种思想入手。我进到隔离的试验槽，
并有过许多小时的幻觉经历，所以我知道关于神秘主义的某些东西。我还去过埃萨
伦，这里是各种思想的温床（这是一个很好的地方，你们应当去看看）。然后我变
得不... 阅读全帖 |
|
发帖数: 1 | 16 11 月13日 终于找到另一股在我家害我的势力
昨天，这些人折腾了一天，白天，晚上皮啦啦，也不知道谁把谁杀了，谁把谁带走了。
反正我先生和孩子被绑架了，就不知道是不是已经遇害了。我本来是打算睡觉的，但他
们头上，地下装电磁波攻击器，让我几乎窒息。虽然我没倒下，但其实他们在我身上扎
的毒针已经蔓延，我能感觉到我的呼吸有窒息的感觉。我想我对他们已经非常仁慈了，
但他们不依不饶地攻击我，欲置我于死地，让我非常生气，特别是肆意伤害我家里的人
，绑架我先生和孩子，而且有许许多多无辜的生命毁于他们之手，有必要把他们曝光。
当然我还没分析这里边是那几个人具体攻击我，伤害我的，但他们显然都是一伙的。鉴
于他们伤害我的头部，胸部 和胃部，我就把这几部分的医生都曝光，受害者慢慢去调
查，追查他们吧。
Cleveland Clinic, Website: my.clevelandclinic.org
Call 855. REFER. 123 or 855.733.3712
Lung Cancer
Results: 57 Doctors
PREV123NEXT
Results per page:
Dav... 阅读全帖 |
|
发帖数: 1 | 17 Result 1 when sorted by price, $710
3:20pm - 6:05pm +1
Flight spans 1 day
Hainan Airlines
Excellent Flight (8.7/10)
13h 45m (Nonstop)
Wi-Fi, Entertainment, and Power information
Departure airport:
ORD -
Arrival airport:
PEK
$710
roundtrip
Select
Select result 1 when sorted by price
Details & baggage fees
Details and baggage fees for result 1
Result 2 when sorted by price, $1,057
12:45pm - 3:15pm +1
Flight spans 1 day
United
Very Good Flight (8.4/10)
13h 30m (Nonstop)
Wi-Fi, Entertainment, ... 阅读全帖 |
|
g********2
发帖数: 6571 | 18 If You Don’t Like Either Candidate, Then Vote for Trump’s Policie
Wayne Grudem
|
Posted: Oct 19, 2016 12:14 AM
After I saw the shocking 2005 video with Trump talking about his sexual
aggression against women, I wrote, “There is no morally good presidential
candidate in this election.” I condemned Trump’s immoral conduct and said
I did not know how I would vote. I asked Townhall.com to remove my earlier
article, “Why Voting for Donald Trump Is a Morally Good Choice.” I urged
Trump to withdraw, ho... 阅读全帖 |
|
b*******t
发帖数: 33714 | 19 ppt直接导出来的，格式有点乱，不过有耐心的话看看还挺有意思的。
==================================
Part 3: Arts and Methods of Kitchen Arts
TOPIC: MEAT
Cooking meat
Cooking meat is all about producing the right texture and flavours.
Texture concerns the structure of meat.
Flavours are all about chemistry –the Maillard reaction.
Components of muscle
Water: 75%
Protein: 18%
Fat: ~4-10%, varies among different types of meat
Carbohydrate: just over 1%
Vitamins, minerals, various organic compounds…
Sliding-filament model of muscle... 阅读全帖 |
|
y****n
发帖数: 192 | 20 用java写了一下，切磋一下哈
main:
// a[0] = （1， 2）-> （7， 9）
// a[1] = （1， 3) -> （4， 5）
// a[2] = （12， 15）
// a[3] = （15， 20）
Interval[] intervals = new Interval[4];
intervals[0] = new Interval(1, 2);
intervals[0].next = new Interval(7, 9);
intervals[1] = new Interval(1, 3);
intervals[1].next = new Interval(4, 5);
intervals[2] = new Interval(12, 15);
intervals[3] = new Interval(15, 20);
Interval result = getUnifiedIntervals(... 阅读全帖 |
|
d****n
发帖数: 233 | 21 Another one for Wildcard match:
public class Solution {
public boolean isMatch(String s, String p) {
int m = s.length() + 1;
int n = p.length() + 1;
boolean[][] result = new boolean[n][m];
result[0][0] = true;
for( int i = 1; i < n; i++){
result[i][0] = p.charAt(i-1) == '*' ? result[i-1][0] : false;
}
for( int j = 1; j < m; j++){
result[0][j] = false;
}
for( int i = 1; i ... 阅读全帖 |
|
b**m
发帖数: 1466 | 22 我的理解就是个DFS， 我写的有啥问题吗？
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public ArrayList> pathSum(TreeNode root, int sum) {
// Start typing your Java solution below
// DO NOT write main() function
ArrayList> results = new ArrayList();
if(root==null){
return results;
}
... 阅读全帖 |
|
y***n
发帖数: 1594 | 23 原题在这里。 http://www.mitbbs.com/article_t/JobHunting/32517841.html 但是觉得不太对
搞这些题觉得很没思路。
// Caclulate (m^n)%(10^k). Keep the k integer numbers in an array.
// Note: the integer numbers are in reversed in the array
// Assume: m>0, n>0, k>0
// Need to check validity outside of this function.
// call calculate(5, 1234566789893943, 1000) to get result.
// Time complexity: O((log n) * k * k)
// Space complexity: O((log n) * k)
vector calculate(unsigned long m, unsigned long n, int k) {
if(... 阅读全帖 |
|
P**********r
发帖数: 755 | 24 struct TreeNode {
string val;
TreeNode *left;
TreeNode *right;
TreeNode(string x): val(x), left(NULL), right(NULL) {}
};
void getexp(TreeNode *root, string &result)
{
if(root->val == "+" || root->val == "-" || root->val == "*" || root->val
== "/")
{
result += '(';
getexp(root->left,result);
result += root->val;
getexp(root->right, result);
result += ')';
}
else
{
result +=root->val;
}
}
string expressiontree(... 阅读全帖 |
|
f*********0
发帖数: 17 | 25 函数参数有了target还要n干嘛？
另外这应该是指数级复杂度的吧？
void recur(int n, int m, vector > &results, vector &result)
{
//if (m > n) return;
if (n == 1) {
results.push_back(result);
return;
}
for (int i = m; i <= n; ++i) {
if (n%i == 0) {
result.push_back(i);
recur(n/i, i, results, result);
result.pop_back();
}
}
}
vector > printFactors(int n) {
vector > results = {{1,32}};
recur(n, ... 阅读全帖 |
|
t****r
发帖数: 702 | 26 http://phx.corporate-ir.net/phoenix.zhtml?c=148005&p=irol-newsA
9293&highlight=
没那么夸张，只是phase I study 有效果而已。。。
Alnylam and Collaborators Publish Results from Phase I Clinical Trial and Ex
tension Study with ALN-VSP, an RNAi Therapeutic for the Treatment of Liver C
ancer
- Results Published in Cancer Discovery Document Most Comprehensive Human Ex
perience To Date for RNAi Therapeutics Delivered with Lipid Nanoparticles (L
NPs) -
CAMBRIDGE, Mass.--(BUSINESS WIRE)--Jan. 30, 2013-- Alnylam Pharmaceu... 阅读全帖 |
|
o*******n
发帖数: 2035 | 27 AMR Corporation Reports Third Quarter Profit of $143 Million
Substantial Improvement Compared to Last Year, Despite Higher Fuel Prices
Recent Highlights Include: Launched Joint Business with British Airways and
Iberia
Received Tentative DOT Approval for Antitrust Immunity with Japan Airlines
Enhancing Strategic Position in Los Angeles
AMR Corporation On Wednesday October 20, 2010, 11:00 am
FORT WORTH, Texas, Oct. 20 /PRNewswire-FirstCall/ -- AMR Corporation, the
parent company of American Airlin... 阅读全帖 |
|
I***5
发帖数: 272 | 28 Thursday（1/19/2012)
American Express Co. reports quarterly financial results.
Bank of America Corp. reports quarterly financial results.
Capital One Financial Corp. reports quarterly financial results.
Google Inc. reports quarterly financial results.
International Business Machines reports quarterly financial results.
Intel Corp. reports quarterly financial results.
Microsoft Corp. reports quarterly financial results.
Morgan Stanley reports quarterly financial results.
Southwest Airlines Co. rep... 阅读全帖 |
|
m********t
发帖数: 9426 | 29 Fri, Sept 2
vs
Youngstown State
max: this is a no brainer, Big Win, by at least 4 TDs
result: W
Sat, Sept 10
vs
Florida Atlantic
max: 3 games in a row, win easily
result: W
Sat, Sept 17
@
Notre Dame
max: last season's dramatic ending adds spice to this game, away game, still
win
result: W
Sat, Sept 24
vs
Central Michigan
max: still remember what they did to us two years ago, a perfect revenge,
huge win
result: W
Sat, Oct 1
@
Ohio State
ma... 阅读全帖 |
|
m********t
发帖数: 9426 | 30 Fri, Sept 2
vs
Youngstown State
max: this is a no brainer, Big Win, by at least 4 TDs
result: W
Sat, Sept 10
vs
Florida Atlantic
max: 3 games in a row, win easily
result: W
Sat, Sept 17
@
Notre Dame
max: last season's dramatic ending adds spice to this game, away game, still
win
result: W
Sat, Sept 24
vs
Central Michigan
max: still remember what they did to us two years ago, a perfect revenge,
huge win
result: W
Sat, Oct 1
@
Ohio State
ma... 阅读全帖 |
|
h*****f
发帖数: 248 | 31 【 以下文字转载自 JobHunting 讨论区 】
发信人: henrysf (Henry), 信区: JobHunting
标 题: Re: L 电面
发信站: BBS 未名空间站 (Thu Oct 18 01:46:20 2012, 美东)
我写了以下的code, 之后就被拒了, 回信是说别的candidate写得比较好, 我还没看出
问题.
Additional requirements:
- The only operators you need to implement are +, -, *, and /.
However, your implementation should make it relatively easy to
add more operators.
- The calculator should accept floating point numbers and output
floating point numbers (i.e. when the input is 2 3 / the result
is 0.66667).
- ... 阅读全帖 |
|
a****a
发帖数: 5763 | 32 http://www.washingtonpost.com/national/health-science/not-so-fa
Not so fast: Second experiment refutes faster-than-light particles
By Brian Vastag, Friday, March 16, 12:50 PM
Anyone who bet against Einstein better get out their wallet.
That’s because those supposedly faster-than-light particles that shook up
the world of physics last September are now looking a lot slower.
38
Comments
Weigh InCorrections?
Personal Post
A second experiment deep in an Italian mountain timed these subatomic
particl... 阅读全帖 |
|
x*x
发帖数: 2001 | 33 胡说
Results 1 - 10 of about 123,000 for 动力澎湃 宝马
Results 1 - 10 of about 115,000 for 动力澎湃 奔驰
Results 1 - 10 of about 87,200 for 动力澎湃 广本
Results 1 - 10 of about 35,900 for 动力澎湃 吉利
Results 1 - 10 of about 29,400 for 动力澎湃 法拉利
Results 1 - 10 of about 25,100 for 动力澎湃 奥迪
Results 1 - 10 of about 24,700 for 动力澎湃 东风
Results 1 - 10 of about 23,100 for 动力澎湃 丰田
Results 1 - 10 of about 16,500 for 动力澎湃 本田
Results 1 - 10 of about 15,800 for 动力澎湃 比亚迪
Results 1 - 10 of about 13,900 for 动力澎湃 马6
Results 1 - 10 of ab |
|
x*x
发帖数: 2001 | 34 Results 1 - 10 of about 123,000 for 动力澎湃 宝马
Results 1 - 10 of about 115,000 for 动力澎湃 奔驰
Results 1 - 10 of about 87,200 for 动力澎湃 广本
Results 1 - 10 of about 35,900 for 动力澎湃 吉利
Results 1 - 10 of about 29,400 for 动力澎湃 法拉利
Results 1 - 10 of about 25,100 for 动力澎湃 奥迪
Results 1 - 10 of about 24,700 for 动力澎湃 东风
Results 1 - 10 of about 23,100 for 动力澎湃 丰田
Results 1 - 10 of about 16,500 for 动力澎湃 本田
Results 1 - 10 of about 15,800 for 动力澎湃 比亚迪
Results 1 - 10 of about 13,900 for 动力澎湃 马6
Results 1 - 10 of about |
|
p***o
发帖数: 714 | 35 Unlike U.S. Food and Drug Administration drug approvals, which are more
precisely timed, the release dates for data from clinical trials is bit
fuzzier, so the timelines here are culled from company guidance when
possible.
The working list of clinical trials expected to complete in 2009 is fairly
long, so expect more information on clinical trials to watch in the coming
weeks.
Company: GTx(GTXI)
Drug/indication: Acapodene for precancerous prostate lesions (high-grade PIN)
Clinical trial event: p... 阅读全帖 |
|
e*n
发帖数: 1511 | 36 【 以下文字转载自 Stock 讨论区 】
发信人: mitbbs2020 (bbc), 信区: Stock
标 题: Re: 【Stragety论坛】Trading with correlations.
发信站: BBS 未名空间站 (Sun Jul 25 19:52:04 2010, 美东)
用option当然可以，但不是必须，
用option可以得到更高的leverage，
但是缺点是散户量小，不容易实现market neutral。
比如1.37的hedge ratio，你要long 137和short 100个才能实现。
13和10就不那么好，而且不容易adjust，看附图就知道不怎么neutral的情况。
说stock不便于对冲，这点我不懂你什么意思。
这本身就是market neutral的strategy。
我测试过DISCA和AXP（paper account)，追踪了至少2个月，涨跌幅从来没超过3%的，
但是这反过来说明这不是一对好的pair。
别的pair，没有任何leverage，一年可以做到100%以上的也有，如果我实际做stock到
这个%，
已经很满意了... 阅读全帖 |
|
q********g
发帖数: 10694 | 37 第一部分：选题与创新
一、先想先写最后做:
1. 做研究之前，必须想清楚：结果能不能发表？发表在哪里？
2. 先把文章大框写好，空出数据，等做完实验填完空就可以发了；正所谓心中有沟壑！
3. 在未搞清“写什么、发哪里、自己研究与同类研究有何出色之处”之前，就不要动
手做！
4. 继续去看文献，去想；想不清楚就做还不如不做！
5. 要想这样做，就得先看文献！要知道如何把文章架起来、要知道别人是如何讨论的
、要知道自己的数据是不是说明了与别人不同的东东或别人没有做过……这个过程就是
阅读文献及思考的过程，这些搞清楚了，写就简单了！
6. 要是先做事，做完发现别人做过，或无法用理论来解释，岂不是冤大头？
二、如何科学选题:
1. 课题选择和国际接轨。想在国际核心期刊发表文献，就必须了解国际研究动态
，选择与国际学术研究合拍的课题。由于多方面因素的影响，我国科学研究选题与国际
先进水平还有一定距离。我国一家权威科研机构不久前在国内挑选了许多前沿领域的研
究课题，准备参与国际合作，但到美国后发现近三分之二的课题已经不属前沿，在美国
很少有人研究。在高校，一些教师治学严谨、基础扎实，但科研成果不突... 阅读全帖 |
|
t*****y
发帖数: 445 | 38 Summary of the Amazon EC2 and Amazon RDS Service Disruption in the US East
Region
Now that we have fully restored functionality to all affected services, we
would like to share more details with our customers about the events that
occurred with the Amazon Elastic Compute Cloud (揈C2 last week, our
efforts to restore the services, and what we are doing to prevent this sort
of issue from happening again. We are very aware that many of our customers
were significantly impacted by this event, and as ... 阅读全帖 |
|
g***j
发帖数: 40861 | 39 【 以下文字转载自 WaterWorld 讨论区 】
发信人: DRL (Derick), 信区: WaterWorld
标 题: 未名词频，供大家乐乐。
发信站: BBS 未名空间站 (Mon May 26 14:47:02 2014, 美东)
老将 About 163,000 results (0.25 seconds)
傻逼 About 139,000 results (0.29 seconds)
小将 About 137,000 results (0.14 seconds)
五毛 About 90,600 results (0.13 seconds)
x轮 About 52,100 results (0.14 seconds)
你妈个逼 About 51,100 results (0.31 seconds)
鸡巴 About 43,600 results (0.29 seconds)
操 About 22,600 results (0.12 seconds)
外F About 22,200 results (0.19 seconds)
操你妈 About 18,700 re... 阅读全帖 |
|
a****r
发帖数: 12375 | 40 peng!
【 以下文字转载自 WaterWorld 讨论区 】
发信人: DRL (Derick), 信区: WaterWorld
标 题: 未名词频，供大家乐乐。
发信站: BBS 未名空间站 (Mon May 26 14:47:02 2014, 美东)
老将 About 163,000 results (0.25 seconds)
傻逼 About 139,000 results (0.29 seconds)
小将 About 137,000 results (0.14 seconds)
五毛 About 90,600 results (0.13 seconds)
x轮 About 52,100 results (0.14 seconds)
你妈个逼 About 51,100 results (0.31 seconds)
鸡巴 About 43,600 results (0.29 seconds)
操 About 22,600 results (0.12 seconds)
外F About 22,200 results (0.19 seconds)
操你妈 About 18... 阅读全帖 |
|
y*******7
发帖数: 579 | 41 网络上看了很多关于这个网站的推介，http://www.gototrafficschool.com/
就注册去上课了，发现价格已经改了，是$19，
不过用promotion code (X2B-C8B-A94) 依然可以减少$2。
现在已经不能只是开着电脑耗时间了，我试着开机，但出去了3-4个小时，回来就要求
重新log in了。而且也不能直接参加final exam，必须答对各章的所有试题才能到达
final exam，而且各章的题目之后还有一题“security question”，就是问关于前面
学习材料中的图片、录像中的内容，所以还不得不点击看看，总共也需要不少时间。不
过有个节约时间的方法，就是先到问题的一页，看完问题再点击“previous”回到前一
页寻找答案，利用IE的“编辑”菜单下“查找（在当前页）”的功能可以快速定位。如
果中途log off再回来log in，得一页页翻过之前做过的章节，不过不需要重新做题就
是。到达上次退出地方，就自动加载之前这一章的内容。
欢迎大家使用promotion code：X2B-C8B-A94
http://www.gototraff... 阅读全帖 |
|
H****y
发帖数: 2992 | 42 多谢大家鼓励！终于写完了。希望共同探讨。
On Scientific Writing
“The ancient historians gave us delightful fiction in the form of fact; the
modern novelist presents us with dull facts under the guise of fiction.” (
Oscar Wilde)
1. Adopt the Right Attitude
Just like everything else, before we start, we have to believe what we do
matters. If we can’t persuade ourselves, how are we going to persuade
others? Writing scientific essays should not be considered as an obligation,
or a pain we go through t... 阅读全帖 |
|
a****x
发帖数: 89 | 43 网上搜到的都没有考虑negative的情况，比如一个tree只有一个node，这个node的值
是negative。
下面是我自己的答案，已经pass OJ：
class LocalResult
{
int localMaxPathSum; // local max path sum
int localSubPathSum; // either root, or root+left, or root+right
public LocalResult(int maxPathSum, int subPathSum)
{
this.localMaxPathSum = maxPathSum;
this.localSubPathSum = subPathSum;
}
}
public class binaryTreeMaxPathSum {
/**
* @param args
*/
public static void main(String[] args) {
/... 阅读全帖 |
|
e******i
发帖数: 106 | 44 这是在career cup 上看到的题：
Given a hashmap M which is a mapping of characters to arrays of substitute
characters, and an input string S, return an array of all possible mutations
of S (where any character in S can be substituted with one of its
substitutes in M, if it exists).
What is the time complexity? What is the space complexity? Can you optimize
either?
Example input:
M = { f: [F, 4], b: [B, 8] }
S = fab
Expected output:
[fab, Fab, 4ab, faB, FaB, 4aB, fa8, Fa8, 4a8]
这是我的解法，用backtrack... 阅读全帖 |
|
j**7
发帖数: 143 | 45 Amazon的第四道面试题跟CodeEval上面的一道题几乎一样。可惜面试的时候没有检查到
bug.
https://www.codeeval.com/open_challenges/59/
public class Main {
/**
* @param args
*/
static StringBuilder build=new StringBuilder();
public static void main(String[] args) {
// TODO Auto-generated method stub
telephone("4155230");
}
static void telephone(String input)
{
telephone(input,0,"");
build.deleteCharAt(build.length()-1);
System.out.println(build.toString());
}
... 阅读全帖 |
|
W********e
发帖数: 45 | 46 题目是leetcode上的Generate Parentheses。
不理解为什么有时候用DFS需要resize，有时候不需要。下面这第一种是resize了，
resize的意义是什么?：
void CombinationPar(vector& result, string& sample, int deep,
2: int n, int leftNum, int rightNum)
3: {
4: if(deep == 2*n)
5: {
6: result.push_back(sample);
7: return;
8: }
9: if(leftNum
10: {
11: sample.push_back('(');
12: CombinationPar(result, sample, deep+1, n, leftNum+1, righ... 阅读全帖 |
|
c********p
发帖数: 1969 | 47 leetcode permutation sequence
先谢谢各位大牛！
我知道这个问题有更好的解法，但我想知道：
我想把第k个permutation存在result中, 无论我result是否设为全局的，它都存不下。
当时读到的时候，有存进去，可是接着run之后就没有了。我要怎么保存它呢？
int count;
StringBuffer result = new StringBuffer();
public String getPermutation(int n, int k) {
// Start typing your Java solution below
// DO NOT write main() function
count = 0;
if(n == 0 || k == 0){
return "";
}
StringBuffer sol = new StringBuffer();
permute... 阅读全帖 |
|
L*******e
发帖数: 114 | 48 试着用Java写了一个。还是不够简练。Have to use String array, otherwise cannot
push the result back to the original array.
public static int evaluate(String[] array, int from, int to){
// get first operator, backward
int j = to;
String s = array[j];
while (j >= from && !Operator.isOperator(s.charAt(0))){
s = array[--j];
}
// get operands
Operator op = Operator.getOperator(s.charAt(0));
int opIndex = j;
int a = Integer.valueOf(array[++j]);
int b = Integer.valueOf(ar... 阅读全帖 |
|
p****n
发帖数: 4 | 49 Get the Sum of 对角线 of 螺旋（线) in n X n
Starting with the number 1 and moving to the right in a counter-clockwise
direction a 5 by 5 .
The issue is that the 1 is in the middle.
Normally:
for example :螺旋（线) (3X3)
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
[leetcode]Spiral Matrix II
(2013-03-12 15:14:57)
转载▼
标签：
分类： leetcode
Given an integer n, generate a square matrix filled with elements from 1 to
n2 in spiral order.
For example,
Given n = 3,
You should return the following matrix:
[
[ 1, 2, 3 ],
[ 8,... 阅读全帖 |
|
