h*******d
发帖数: 39 | 1 http://www.bbc.co.uk/dna/606/F18938939?thread=7794908&skip=0&show=50
comment by hizento (U8679012)
posted 7 Hours Ago
Hundreds of malunirished men look like they been dragged off the streets bea
ting at old dirty drums. The performance lack coordination, flamboyant and e
scapacism, there were long delays between shows, there is no "wow" factor, s
ome of the ideas are not original, ie the firework display, the children pai
nting a cloth (remember Manchester 2002?), the use of projectors highlight... 阅读全帖 |
|
l******s
发帖数: 3045 | 2 A validated C# Enumerator solution.
public class EmbeddedList : IEnumerable{
private bool isValue;
private T val;
private IList> ElementList = new List>();
public EmbeddedList() { isValue = false; }
public EmbeddedList(T t) { val = t; isValue = true; }
public void Add(T t){
EmbeddedList newElement = new EmbeddedList(t);
ElementList.Add(newElement);
}
public void Add(EmbeddedList E) { ElementList.Ad... 阅读全帖 |
|
l******s
发帖数: 3045 | 3 A validated C# Enumerator solution.
public class EmbeddedList : IEnumerable{
private bool isValue;
private T val;
private IList> ElementList = new List>();
public EmbeddedList() { isValue = false; }
public EmbeddedList(T t) { val = t; isValue = true; }
public void Add(T t){
EmbeddedList newElement = new EmbeddedList(t);
ElementList.Add(newElement);
}
public void Add(EmbeddedList E) { ElementList.Ad... 阅读全帖 |
|
P*******L
发帖数: 2637 | 4 我的解，用了 BFS。还有很多优化的余地，但是已经 0.5s 过了。
public class Solution {
public void solve(char[][] board) {
int n = board.length;
if(n <= 2) return;
int m = board[0].length;
if(m <= 2) return;
Queue qi = new LinkedList();
Queue qj = new LinkedList();
for(int i = 0; i < n; i++) {
if(board[i][0] == 'O') {
qi.add(i); qj.add(0);
}
if(board[i][m-1] == 'O') {
... 阅读全帖 |
|
p****x
发帖数: 4260 | 5 ☆─────────────────────────────────────☆
fuchl (hello) 于 (Sat Feb 4 23:02:16 2012, 美东) 提到:
首先置顶提醒一下本版的置底deal #1 rule: Do NOT call, Do NOT email.
特别是如果你已经注册了两个或以上的bonus，如果你已经做了cycle，更不能call。
有问题请re本帖或者站内PM我，请尽量不要另开新帖。
update 04/15: 目前基本确认cycle还可以，还不算太坏。但是能不能dip还不确定，目前没有人拿到，很可能已经死了。
update 04/09: deal疑似已死，cycle bug也有待验证。flyertalk原帖作者HikerT的更新："As of April 2012 Fidelity has added new terms indicating promotional offers are limited to one per individual per rolling 12 months. As such, the doubl... 阅读全帖 |
|
K****N
发帖数: 10783 | 6 转载
My Top 21 Favorite Foods to Mix with Protein Powder
1. Milk - Just use milk instead of water for more flavor, more thickness,
and more calories. Try goat’s milk for an extra health kick.
2. Cream - Use instead of milk or water for way more flavor and calories.
3. Fruit - Blend it up and it’s called a fruit smoothie. Try
strawberries and bananas. Add fruit to just about all of these other recipes
. Fruit adds vitamins, minerals, and antioxidants so don’t hesitate to add
it to anything... 阅读全帖 |
|
m****s
发帖数: 1945 | 7 俺估算：
Levels: 16-26
Sentence: minimum 21-27 months, maximum 63-78 months
Itemized below
Base 6, if convicted
b(1) 8-12, depending on the loss
b(2) 2-4, depending on the number of victims
b(6) 2, depending on prosecutor
b(17) 2, depending on prosecutor
www.ussc.gov/guidelines-manual/2013/2013-2b11
B1.1. Larceny, Embezzlement, and Other Forms of Theft; Offenses Involv
ing Stolen Property; Property Damage or Destruction; Fraud and Deceit; Forge
ry; Offenses Involving Altered or Counterfeit Instr... 阅读全帖 |
|
m****s
发帖数: 1945 | 8 俺估算结果
Levels: 16-26
Sentence: minimum 21-27 months, maximum 63-78 months
Itemized below
Base 6, if convicted
b(1) 8-12, depending on the loss
b(2) 2-4, depending on the number of victims
b(6) 2, depending on prosecutor
b(17) 2, depending on prosecutor
www.ussc.gov/guidelines-manual/2013/2013-2b11
B1.1. Larceny, Embezzlement, and Other Forms of Theft; Offenses Involvin
g Stolen Property; Property Damage or Destruction; Fraud and Deceit; Forgery
; Offenses Involving Altered or Counterfeit Inst... 阅读全帖 |
|
m******r
发帖数: 1904 | 9 ☆─────────────────────────────────────☆
hmis (hmis) 于 (Thu Mar 1 23:42:02 2012, 美东) 提到:
最近，我和iUSMLE 分别发了CS考经，私底下收到不少同学们的询问。而且呢，最近考
CS的童孩不少。所以呢，我们商量一起给大家一个小的经验介绍。报名的童孩就跟跟贴
。不过呢，由于我的计算机不太灵光。也许呢，不能同时HOLD那老多人。见谅哈！！！
还有呢，IUSMLE美眉还要照顾小孩，特地抽时间来讲，大赞。
最后呢，希望斑竹发包子，鼓励一下。同时呢，呼吁如果您最近拿到CS好成绩， 又想
找人说说话，就给我写个信，咱们一起呢为其他童孩帮帮忙！！！
☆─────────────────────────────────────☆
hmis (hmis) 于 (Thu Mar 1 23:44:09 2012, 美东) 提到:
忘了说了，向下星期六（10号）EST 9：00PM。
没和MATCH DAY 冲突吧？
☆─────────────────────────────────────☆
... 阅读全帖 |
|
m******r
发帖数: 1904 | 10 ☆─────────────────────────────────────☆
daisyy (daisy) 于 (Mon Jul 2 23:19:52 2012, 美东) 提到:
时间： 7月7日 10am -12noon EST
地点： Webinar
老师： Content, Cynthia09, Daisyy, Doctorvivian, Gladpeng
ICE (data gathering, PN), CIS (Questioning skill, Information sharing,
Professional manners and rapport), SEP
根据最近出成绩童鞋们的反馈， 有同学在data gathering 或者information sharing
上面fail了，所以找了在这些方面performance比较好的同学给大家分享一下他们的经
验。
有兴趣参加的同学请在这下面报名。请恕不接受私下报名，谢谢！
我会把我做externship的经历给大家简单说一下。有兴趣的同学也请在这下面报名。
☆─────────────────────... 阅读全帖 |
|
e*****w
发帖数: 144 | 11 加减乘，没用+-*/号。
#include
using namespace std;
int Add(int a, int b) {
return (b ? Add(a ^ b, (a & b) << 1) : a);
}
int Sub(int a, int b) {
return Add(a, Add(~b, 1));
}
int Mul(int a, int b) {
if (b == 0) return 0;
if (b < 0) return Mul(Sub(0, a), Sub(0, b));
return Add(a, Mul(a, Sub(b, 1)));
}
int main() {
cout << "Add(3, 4) = " << Add(3, 4) << endl;
cout << "Add(3, -8) = " << Add(3, -8) << endl;
cout << "Add(-8, 40) = " << Add(-8, 40) << endl;
cout << "Sub(3, 4) = " <<... 阅读全帖 |
|
e*****w
发帖数: 144 | 12 加减乘，没用+-*/号。
#include
using namespace std;
int Add(int a, int b) {
return (b ? Add(a ^ b, (a & b) << 1) : a);
}
int Sub(int a, int b) {
return Add(a, Add(~b, 1));
}
int Mul(int a, int b) {
if (b == 0) return 0;
if (b < 0) return Mul(Sub(0, a), Sub(0, b));
return Add(a, Mul(a, Sub(b, 1)));
}
int main() {
cout << "Add(3, 4) = " << Add(3, 4) << endl;
cout << "Add(3, -8) = " << Add(3, -8) << endl;
cout << "Add(-8, 40) = " << Add(-8, 40) << endl;
cout << "Sub(3, 4) = " <<... 阅读全帖 |
|
y*******5
发帖数: 887 | 13 用composition pattern:
1:---
package NestedIterator;
public interface NestedNodeList extends Iterable {
}
2:---
package NestedIterator;
import java.util.Iterator;
public class Node implements NestedNodeList {
private E val;
public Node(E val) {
this.val = val;
}
@Override
public Iterator iterator() {
return new NodeIterator();
}
private class NodeIterator implements Iterator {
private boolean iterated = false;
@Override... 阅读全帖 |
|
O**********m
发帖数: 781 | 14 这是复杂版西式做法,我个人认为不需要如此麻烦, 汤也不够清淡.
How to Make Beef Stock
Learn to make beef stock and get recipes for putting it to delicious use!
Beef stock takes about eight hours to simmer, but once it’s done, you’ll
have a great base for soups, sauces, stews, and other savory dishes.
1. Ingredients: 1 tomato or 3 ounces tomato paste, 1 large carrot, 2 celery
stalks, 2 medium onions, 15 black peppercorns, and 1 bay leaf (optional
ingredients: herb stems from parsley and thyme). You can use beef bones and
beef ... 阅读全帖 |
|
F*****1
发帖数: 779 | 15 could open a beer with her teeth. HOT
Reply · 13 · Like· Yesterday at 4:46am
Mark as SpamReport as Abuse
Dean Collins · Top Commenter · Co-founder at LiveFanChat.com
lol well Kim Kardashian has a butt you could land a fighter jet on....it's
all relative i guess.
Reply · 3 · Like· Yesterday at 8:26am.
Mark as SpamReport as Abuse
Anthony HighOne Morris · Philadelphia, Pennsylvania
Dean Collins , what's wrong with that? She only gets with men that can
handle it. That's why she plays in the "Jungle"... 阅读全帖 |
|
l***m
发帖数: 339 | 16 JAVA 不太熟，尝试着快速写了下这两道题，请各位大牛帮忙看看啊，有没有什么
问题。当然我这里没有考虑大数问题，这个呆会我再想想，或者谁教我也好。
public class RomansToInt {
public static HashMap map;
public static int RomanToInt(String input) {
if (input == null || input.length() == 0) {
System.out.println("The input is not valid");
return -1;
}
int len = input.length();
if (len == 1) {
return map.get(input.charAt(0));
}
int result = 0;
int i =... 阅读全帖 |
|
t********n
发帖数: 611 | 17 import java.util.HashMap;
import java.io.IOException;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.BufferedReader;
import java.io.File;
import java.util.*;
public class Cluster4{
public static void main(String args[]) throws FileNotFoundException,
IOException{
long startTime = System.currentTimeMillis();
String line;
String path = "/Users/***/documents/java/coursera_2/week_2/
problem_2/clustering_big.txt";
File nodeFile = ne... 阅读全帖 |
|
g**********y
发帖数: 14569 | 18 Mike Tolbert (SD - RB) Add Waivers ($110) 阿紫(gochiefs)
【大手笔！！！】
Pierre Garcon (Ind - WR) Add Waivers ($12) 张三丰 (berniefu)
Jonathan Stewart (Car - RB) Add Waivers ($10) 张三丰 (berniefu)
Vincent JacksonNA (SD - WR) Add Waivers ($10) 逍遥子(Hearst)
【剪不断，理还乱】
San Francisco (SF - DEF) Add Waivers ($3) 戒烟客(gloomyturkey)
New York (NYG - DEF) Add Waivers ($3) 张三丰 (berniefu)
Brandon Jacobs (NYG - RB) Add Waivers ($2) 无忌
【天使投资？还是有内幕消息？】
Roy Williams (Dal - WR) A... 阅读全帖 |
|
m******r
发帖数: 1904 | 19 ☆─────────────────────────────────────☆
daisyy (daisy) 于 (Tue Aug 21 00:33:49 2012, 美东) 提到:
座谈内容：Step 1 考试经验
万事开头难。过来人都知道，Step 1的准备是所有steps 里面最艰难的一步。 你是否
正在准备step 1，由于进展不大感到frustrated? 或者你刚刚开始准备，毫无头绪？
欢迎你加入step 1 座谈会。 Emma和Daisy
跟你分享她们备考step 1的历程。
时间： August 24, Friday, 8PM EST
地点：Webinar
请感兴趣的同学在下面报名。
☆─────────────────────────────────────☆
gosarah (sarah) 于 (Tue Aug 21 00:35:39 2012, 美东) 提到:
Please count me in. Thanks.
☆─────────────────────────────────────☆
xhu1 (peter) 于 (Tue A... 阅读全帖 |
|
T******g
发帖数: 790 | 20 不自己写Node->LinkedList了，直接import java.util.*;?
可以不可以？比如这个切割链表的代码:package chapter2;
import java.util.*;
public class CC2_4{
public static LinkedList partition(LinkedList list,int k){
if(list==null)
return null;
LinkedList less=new LinkedList();
LinkedList noLess=new LinkedList();
for(int i=0;i
if(list.get(i)
less.add(list.get(i));
}else{
noLess.add(list.get(i));
}
}
less.addAll(noLess);
return less;
}
public static void mai... 阅读全帖 |
|
I*******g
发帖数: 7600 | 21 using dynamic programming (cache):
public class Operations
{
static class OperationFormula
{
public int value;
public String formula;
public OperationFormula(int x, String y){
value = x;
formula = y;
}
}
static Map, HashSet> map = new
HashMap,HashSet>();
public static void main( String[] args )
{
int target = 48;
Integer[] item ... 阅读全帖 |
|
g**********y
发帖数: 14569 | 22 Mike Tolbert (SD - RB) Add Waivers ($35) 戒烟客(gloomyturkey)
Chris Cooley (Was - TE) Add Waivers ($15) 戒烟客(gloomyturkey)
Joel Dreessen (Hou - TE) Add Waivers ($5) 戒烟客(gloomyturkey)
New York (NYG - DEF) Add Waivers ($5) 扫地僧(dango)
Christopher Ivory (NO - RB) Add Waivers ($3) 小玄子
Aaron Hernandez (NE - TE) Add Waivers ($3) 扫地僧(dango)
Cleveland (Cle - DEF) Add Waivers ($3) 虚竹子(bison)
Oakland (Oak - DEF) Add Waivers ($1) ... 阅读全帖 |
|
m******i
发帖数: 9479 | 23 http://www.mendosa.com/low_carb_low_gi_foods.htm
My Favorite Low Carb
and Low GI Foods
By David Mendosa
More and more people with diabetes, myself included, are turning to low
glycemic and low carb foods to help them control their condition.
Unavailable carbohydrates are...fiber.
Some of the low carb and low GI foods that I can recommend to others are
listed below. I have tested almost all of them and note the exceptions.
If you go to a glycemic index looking for very low GI foods you might be
c... 阅读全帖 |
|
d**********o
发帖数: 1321 | 24 我与Emacs的不解情缘（9）
差不多去年暑假后回学期也学会了自己写macro，贴个前段时间做题时写过的写lc的模
板吧：M-x lc ENT ：
(fset 'lc
[?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?i ?o ?s ?t ?r ?e ?a ?m ?> return ?# ?i ?n
?c ?l ?u ?d ?e ? ?< ?v ?e ?c ?t ?o ?r ?> return ?# ?i ?n ?c ?l ?u ?d ?e ?
?< ?a ?l ?g ?o ?r ?i ?t ?h ?m ?> return ?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?c ?s
?t ?r ?i ?n ?g ?> return ?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?c ?m ?a ?t ?h ?>
return ?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?s ?t ?a ?c ?k ?> return ?# ?i ?n ?c ?l
?u ?d ?e ? ?< ?q ?u ?e ?u ?e ?> retur... 阅读全帖 |
|
d**********o
发帖数: 1321 | 25 我与Emacs的不解情缘（9）
差不多去年暑假后回学期也学会了自己写macro，贴个前段时间做题时写过的写lc的模
板吧：M-x lc ENT ：
(fset 'lc
[?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?i ?o ?s ?t ?r ?e ?a ?m ?> return ?# ?i ?n
?c ?l ?u ?d ?e ? ?< ?v ?e ?c ?t ?o ?r ?> return ?# ?i ?n ?c ?l ?u ?d ?e ?
?< ?a ?l ?g ?o ?r ?i ?t ?h ?m ?> return ?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?c ?s
?t ?r ?i ?n ?g ?> return ?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?c ?m ?a ?t ?h ?>
return ?# ?i ?n ?c ?l ?u ?d ?e ? ?< ?s ?t ?a ?c ?k ?> return ?# ?i ?n ?c ?l
?u ?d ?e ? ?< ?q ?u ?e ?u ?e ?> retur... 阅读全帖 |
|
d****n
发帖数: 1637 | 26 here are more output from my machine.
I realized that for a large matrix size it eats too much memory.
$ ./mx_int32 20000
naive add: 3.650000 second; m[10000][10000]=-1256136404
better add: 3.100000 second; m[10000][10000]=-1256136404
sse2 add: 2.970000 second; m[10000][10000]=-1256136404
$ ./mx_int32 30000
naive add: 7.990000 second; m[15000][15000]=1948902602
better add: 6.350000 second; m[15000][15000]=1948902602
sse2 add: 5.790000 second; m[15000][15000]=1948902602
$ ./mx_int32 40000
naiv... 阅读全帖 |
|
p*****2
发帖数: 21240 | 27 java 400多毫秒，scala 1000毫秒超时。
object test6 extends App {
def add(x:Int, y:Int):Unit={
if(x<1 || x>n || y<0) return;
val yy=Math.min(y,a(x)+1)
if(v(x)(yy)) return
queue+=Array(x,yy)
v(x)(yy)=true
}
val sc=new Scanner(new File("input.txt"))
val out=new PrintWriter("output.txt")
val n=sc.nextInt
val a=new Array[Int](n+1)
val v=Array.ofDim[Boolean](105, 100005)
val queue=Queue[Array[Int]]()
for(i<-1 to n) a(i)=sc.nextInt
... 阅读全帖 |
|
发帖数: 1 | 28 We just got another update from Karl.
Beginning tomorrow, a slate of 10 new Mad plans will be offered.
Two of them are free and eight of them have monthly fees.
There will be no "Truly Free" plans, going forward.
1) All of the plans compare very favorably with the competition. RingPlus
will still be the best deal around.
2) There will be special perks and pricing for Member+.
3) If you are currently on a free plan then you will be able to switch, for
free, for the next week. If you're not on... 阅读全帖 |
|
M***A
发帖数: 5 | 29 list of object, object can be Integer or List, recursion
import java.util.*;
public class NestedList {
public static void main(String[] args) {
List list = new ArrayList();
list.add(1);
list.add(2);
List sublist = new ArrayList();
sublist.add(3);
sublist.add(4);
list.add(sublist);
sublist = new ArrayList();
List sublist2 = new ArrayList();
sublist2.add(5);
sublist2.add(6);
sublist2.add(7);
... 阅读全帖 |
|
g**********y
发帖数: 14569 | 30 Nov 17 4:39am Keiland Williams (Was - RB) Add Waivers ($35) 无忌
Nov 17 4:39am Mario Manningham (NYG - WR) New player notes Add
Waivers ($26) 张三丰 (berniefu)
Nov 17 4:39am Matt Cassel (KC - QB) New player notes Add Waivers (
$15) 无忌
Nov 17 4:39am Zach Miller (Oak - TE) New player notes Add Waivers
($11) 逍遥子(Hearst)
Nov 17 4:39am Anthony Fasano (Mia - TE) New player notes Add
Waivers ($9) 无忌
Nov 17 4:39am New Orleans (NO - DEF) No ... 阅读全帖 |
|
m******r
发帖数: 1904 | 31 ☆─────────────────────────────────────☆
hmis (hmis) 于 (Tue Mar 6 20:32:26 2012, 美东) 提到:
开讲了，开讲了 让我们一起学习，交流吧！！！
为了不和3/10 DR。PUMA的课冲突，我们把时间换到3/11。为了更好的让大家提问并得
以回答，这次是以小组形式的集体活动。请各位同学找到自己的老师并以SKYPE 联络。
也请各位老师，9：00PM准时上线，我会在8：30PM上线，如有任何需要请及时有我线上
沟通。
经过一番寻觅，我们此次找到5 名小老师，学生49人次
讲座时间：9：00PM EST
讲座方式：分组，分组情况如下，请各位ID找到相应的小组并与主讲人联系。
讲座时间：随各位老师和童孩要求而定
讲座目的：给各位即将考试的童孩对CS考试一些简单的了解，尽量答疑。
对老师们的要求：尽量做到知无不言哈
对学生们的要求：因为我们这次是分小组进行，希望有心的同学能够写写个小组的摘要
，也是小组门之间的一个交流。
☆─────────────────────────────────────☆
h... 阅读全帖 |
|
|
|
c***c
发帖数: 21374 | 34 ☆─────────────────────────────────────☆
phial (ppp) 于 (Fri Nov 18 00:15:25 2011, 美东) 提到:
中国民间舆论和媒体舆论彻底分裂了
南方系从来没在网上被这样骂过吧
http://www.weibo.com/nfbyw
翻了快10页了 全是去骂南方系的
☆─────────────────────────────────────☆
smokinggun (硝烟) 于 (Fri Nov 18 00:33:28 2011, 美东) 提到:
南方系背后是福特系，现在更应该对福特系穷追猛打！
☆─────────────────────────────────────☆
doginafei (自带豆包的六毛) 于 (Fri Nov 18 00:43:44 2011, 美东) 提到:
☆─────────────────────────────────────☆
rainyrry (Flora) 于 (Fri Nov 18 00:46:42 2011, 美东) 提到:
其... 阅读全帖 |
|
A**l
发帖数: 2650 | 35 我靠，随手上autozone搜了下 code reader，这个入门级和专业级别的差价也忒大了啊
Code Reader
Showing 1 - 10 of 50 ItemsNEXT Page of 5 | Show All
Sort by Price: High Low
Actron/OBD I code scanner
(0 reviews)
Part Number: CP9001
Category: Scanner
STORE PICK UP
AVAILABLE
SHIP TO HOME
AVAILABLE
ADD TO CART
Price: $29.99
Innova/OBD II CarScan Code Reader for all 1996 and newer European, Asian,
domestic, 2010 and newer diesel and hybrid compliance
(0 reviews)
Part Number: INN30203
Category: Scanner
STORE PICK UP
SPEC... 阅读全帖 |
|
B*****7
发帖数: 137 | 36 自己写了一个code，和大多数网上的code一样，基本思路就是bfs。但要过大oj还真不
容易。我refactor了半天也只能有大概一半的概率过。过的时候时间都是800 ms 以下
（～750 ms），只有一次到过800 ms. 所以强烈怀疑这道题的时间上限是800 ms. LOL
我附了code，用java写的。大牛们帮忙看看该怎么改进？先谢谢啦。
public class Solution {
public void solve(char[][] board) {
// Start typing your Java solution below
// DO NOT write main() function
int m = board.length;
if( m == 0 ) return;
int n = board[0].length;
// special cases
if( m < 3 || n < 3 ) return;
// p... 阅读全帖 |
|
c********p
发帖数: 1969 | 37 我的跑不过的。。。
import java.util.*;
public class Solution {
public ArrayList> findLadders(String start, String end
, HashSet dict) {
// Start typing your Java solution below
// DO NOT write main() function
ArrayList> ret = new ArrayList>(
);
if(dict.isEmpty()){
return ret;
}
int len = 1;
int len2 = 0;
Queue q = new LinkedList();
... 阅读全帖 |
|
l*********h
发帖数: 15 | 38 LinkedIn 的题
"Program an iterator for a List which may include nodes or List i.e. * {0,
{1,2}, 3 ,{4,{5, 6}}} Iterator returns 0 - 1 - 2 - 3 - 4 - 5 - 6"
今天翻Design Pattern 的时候看到iterator and composite pattern 突然发现这个和
前一阵一直不会写的Deep Iterator有点像
大概思路是这样的，用一个stack 存放 iterator 如果到了最底层是Integer就输出，
如果iterator.next还是个List,就把这个List的iterator 扔到stack里面，然后
Recusion next()方法。每回从stack里面取的时候看看那个iterator有没有用完，如果
已经遍历到最后用完了，就直接扔出stack
底下是程序
import java.util.ArrayList;
import java.util.Iterator;
import java.util.... 阅读全帖 |
|
l*********h
发帖数: 15 | 39 LinkedIn 的题
"Program an iterator for a List which may include nodes or List i.e. * {0,
{1,2}, 3 ,{4,{5, 6}}} Iterator returns 0 - 1 - 2 - 3 - 4 - 5 - 6"
今天翻Design Pattern 的时候看到iterator and composite pattern 突然发现这个和
前一阵一直不会写的Deep Iterator有点像
大概思路是这样的，用一个stack 存放 iterator 如果到了最底层是Integer就输出，
如果iterator.next还是个List,就把这个List的iterator 扔到stack里面，然后
Recusion next()方法。每回从stack里面取的时候看看那个iterator有没有用完，如果
已经遍历到最后用完了，就直接扔出stack
底下是程序
import java.util.ArrayList;
import java.util.Iterator;
import java.util.... 阅读全帖 |
|
j**********3
发帖数: 3211 | 40 我的代码，Time Limit Exceeded.
自己拖下来放到eclipse里边，跑到死机了。。。到底哪里出错了？
public int numIslands(char[][] grid) {
if(grid == null){
return 0;
}
int m = grid.length;
if(m == 0){
return 0;
}
int n = grid[0].length;
char c = 'A';
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
if (grid[i][j] == '1') {
bfs(grid, i, j, c, m, n);
c = (char)(c + 1)... 阅读全帖 |
|
t*a
发帖数: 18880 | 41 这个可以做个参考：
http://www.greatschools.org/florida/gainesville/schools/?gradeL
Healthy Learning Academy Charter School
Charter · K-5
2101 NW 39th Ave
Gainesville, FL 32605
We love Healthy Learning Academy!!! This school has it a...
Read more (17)
Compare
Add to My School List
Homes for sale
Stephen Foster Elementary School
Public · K-5
3800 NW 6th St
Gainesville, FL 32609
My Grandson attends Stephen Foster and the teachers there...
Read more (7)
Compare
Add to My School List
Homes for sale
Kimball Wi... 阅读全帖 |
|
b**********h
发帖数: 419 | 42 究竟难在哪里？
; Win Cih Source Code
;I m not the dissembler of the code and really I don't know ;who is the
writer or dissembler . Compile or run this program ;at your own risk. Also I
m not giving any guarantee of running ;the program !!!.
;****************************************************************************
; * The Virus Program Information *
;****************************************************************************
; * *
; * Designer : CIH Source : TTIT of TATUNG in Taiwan... 阅读全帖 |
|
c*9
发帖数: 3241 | 43 注意时间， 自下而上。。。
From: "Feiyu Xie" Add to Address Book Add Mobile Alert
To: "'yes no'" , "'Hanlin Li'" , "
'Jin Ya'" , "'Qi Wang'" , rita.gao@
sz.chn.tuv.com
Subject: FW: letter against Hanlin in Wenxuecity
Date: Tue, 24 Jan 2006 11:47:26 +0800
A friend of mine forwarded this to me. Hanlin, I think you should act
immediately and let both your boss and Gang’s boss know about it, explain
the facts in ... 阅读全帖 |
|
t*****e
发帖数: 15794 | 44 查了查，似乎适合配蘑菇，一起作lasagna。
Search
Wild Mushroom and Pecorino Lasagna
Recipe courtesy of Emeril Lagasse
13 Reviews
SAVE
Total Time: 2 hr 55 min
Prep: 30 min
Inactive: 15 min
Cook: 2 hr 10 min
Yield: 8 servings
Level: Intermediate
Next Recipe
Ingredients
2 tablespoons olive oil
9 tablespoons unsalted butter, divided
1 cup diced onion
1 tablespoon minced garlic
3 pounds wild and exotic mushrooms, cleaned and diced
2 teaspoons freshly chopped thyme leaves
2 teaspoons freshly chopped marjoram leaves... 阅读全帖 |
|
s*******e
发帖数: 35 | 45 用HASHMAP 找出每个WORD 所在的位置 occurrence map，在做一个反向的由所在位置(
position)到WORD 的reverse occurrence map。 吧这些position 排序，然后递归搜索。
package smartnose;
import java.util.Arrays;
import java.util.*;
public class SubWordSeq {
public static void main(String [] args){
List L = new LinkedList();
L.add("fooo");L.add("barr");L.add("wing");L.add("ding");L.add("wing"
);
String S= "lingmindraboofooowingdingbarrwingmonkeypoundcake";
HashMap<... 阅读全帖 |
|
s*******e
发帖数: 35 | 46 用HASHMAP 找出每个WORD 所在的位置 occurrence map，在做一个反向的由所在位置(
position)到WORD 的reverse occurrence map。 吧这些position 排序，然后递归搜索。
package smartnose;
import java.util.Arrays;
import java.util.*;
public class SubWordSeq {
public static void main(String [] args){
List L = new LinkedList();
L.add("fooo");L.add("barr");L.add("wing");L.add("ding");L.add("wing"
);
String S= "lingmindraboofooowingdingbarrwingmonkeypoundcake";
HashMap<... 阅读全帖 |
|
s********x
发帖数: 914 | 47 大概是这个思路吧，没有测
public static TreeNode sortedArrayToBST(int[] a)
{
TreeNode root = new TreeNode();
int left = 0, right = a.length - 1;
Queue indexes = new LinkedList();
Queue nodes = new LinkedList();
nodes.add(root);
indexes.add(left);
indexes.add(right);
while (!indexes.isEmpty())
{
left = indexes.poll();
right = indexes.poll();
TreeNode p = nodes.poll();
int mid = left + (right - left) >>> 1;
p.setValue(a[mid]);
TreeNode leftChild = null, rightChild = nu... 阅读全帖 |
|
b****z
发帖数: 176 | 48 代码如下：
基本思路是，用queue 进行BFS，记录了每个node的parent，找到之后，通过parent来
recover path。感觉没有任何冗余计算啊！！！为什么过不了？
谢谢各位！！
import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Set;
public class Solution {
public List> findLadders(String start, String end, Set<
String> dict) {
List> res = new ArrayList>();
Set visited = new HashSet();
... 阅读全帖 |
|
