由买买提看人间百态

topics

全部话题 - 话题: inputting
首页 上页 1 2 3 4 5 6 7 8 9 10 下页 末页 (共10页)
t**********n
发帖数: 213
1
恩,那就买lightspeed那个QRF solo with audio input了,100刚出头,性价比很不错
f**d
发帖数: 768
2
来自主题: Neuroscience版 - eBook: From computer to brain
这是一本计算神经科学的优秀著作,全文拷贝这里(图和公式缺),有兴趣的同学可以
阅读
如需要,我可以分享PDF文件(--仅供个人学习,无商业用途)
From Computer to Brain
William W. Lytton
From Computer to Brain
Foundations of Computational Neuroscience
Springer
William W. Lytton, M.D.
Associate Professor, State University of New York, Downstato, Brooklyn, NY
Visiting Associate Professor, University of Wisconsin, Madison
Visiting Associate Professor, Polytechnic University, Brooklyn, NY
Staff Neurologist., Kings County Hospital, Brooklyn, NY
In From Computer to Brain: ... 阅读全帖
c*******n
发帖数: 671
3
谢谢,以下是我的X11/xorg.0.log, 我看不出来什么问题?是的我不应该删lightdm,
不是那个的问题。startx会出现我上面帖子写的Loading extension GLX, fatal
server error: no screen found. 请问我该怎么修复xwindow? 谢谢!
[ 4.113]
X.Org X Server 1.13.0
Release Date: 2012-09-05
[ 4.113] X Protocol Version 11, Revision 0
[ 4.113] Build Operating System: Linux 3.2.0-37-generic x86_64 Ubuntu
[ 4.113] Current Operating System: Linux x-ThinkPad-X201 3.5.0-49-generic
#74-Ubuntu SMP Fri May 2 23:28:58 UTC 2014 x86_64
[ 4.113] Kernel command line: BOOT_IM... 阅读全帖
s**********8
发帖数: 25265
4
来自主题: MedicalDevice版 - key device GMP component - design control
Design Controls
INTRODUCTION
Coverage
QUALITY SYSTEM
Personnel Training
DESIGN AND DEVELOPMENT PLANNING
Interface
Structure of Plans
DESIGN INPUT
Input Checklists
DESIGN REVIEW
Combination Devices
Preparation For Reviews
Why Design Reviews
Types Of Design Review Meetings
Design Review Requirements
End Of Initial Design
DESIGN OUTPUT
Documenting Design Output
Acceptance Criteria
Design Output Approval
DESIGN VERIFICATION AND VA... 阅读全帖
I**********s
发帖数: 441
5
最喜欢 wwwyhx的解法: recursive descent.
我也写了个, 用的是建造AST, 再evaluate AST. 应该相当完整了: 数字之前可以有+-
号, 中间可以有一个小数点. 数字和运算符号之间可以有空格. 可以使用+,-,*,/,^,以
及括号. 可以检测错误输入并报出错误位置. 就是比较长, 不适合面试用. 供大家参考.
#include
#include // for pow()
using namespace std;
struct Node {
double val;
char op;
int op_prec; // precedence of operator
int type; // 0 - operand, 1 - operator
Node * left;
Node * right;
Node(double _val, char _op, int _type) : val(_val), op(_op),
type(_type), lef... 阅读全帖
I**********s
发帖数: 441
6
最喜欢 wwwyhx的解法: recursive descent.
我也写了个, 用的是建造AST, 再evaluate AST. 应该相当完整了: 数字之前可以有+-
号, 中间可以有一个小数点. 数字和运算符号之间可以有空格. 可以使用+,-,*,/,^,以
及括号. 可以检测错误输入并报出错误位置. 就是比较长, 不适合面试用. 供大家参考.
#include
#include // for pow()
using namespace std;
struct Node {
double val;
char op;
int op_prec; // precedence of operator
int type; // 0 - operand, 1 - operator
Node * left;
Node * right;
Node(double _val, char _op, int _type) : val(_val), op(_op),
type(_type), lef... 阅读全帖
a***y
发帖数: 19743
7
来自主题: Apple版 - [合集] 刚退了ipad
☆─────────────────────────────────────☆
laomagua (老马褂) 于 (Thu Apr 22 19:29:58 2010, 美东) 提到:
白玩了两周, 结论, 实在不需要这么大个itouch
☆─────────────────────────────────────☆
aaaty (阿提 - Hardcore Flash Hater) 于 (Thu Apr 22 19:37:13 2010, 美东) 提到:
你不是发过了吗?

☆─────────────────────────────────────☆
laomagua (老马褂) 于 (Thu Apr 22 19:38:34 2010, 美东) 提到:
发的是打算退, 今晚去退了
☆─────────────────────────────────────☆
aaaty (阿提 - Hardcore Flash Hater) 于 (Thu Apr 22 19:41:13 2010, 美东) 提到:
不知道你哪来怎么玩的
我觉得这个不是大号ipo... 阅读全帖
t*******a
发帖数: 51
8
来自主题: Automobile版 - 引擎灯亮,Code求解释,谢谢
P0100 Mass or Volume Air Flow Circuit Malfunction
P0101 Mass or Volume Air Flow Circuit Range/Performance Problem
P0102 Mass or Volume Air Flow Circuit Low Input
P0103 Mass or Volume Air Flow Circuit High Input
P0104 Mass or Volume Air Flow Circuit Intermittent
P0105 Manifold Absolute Pressure/Barometric Pressure Circuit Malfunction
P0106 Manifold Absolute Pressure/Barometric Pressure Circuit Range/
Performance Problem
P0107 Manifold Absolute Pressure/Barometric Pressure Circuit Low Input
P0108 ... 阅读全帖
S**I
发帖数: 15689
9
来自主题: JobHunting版 - [合集] 问个facebook 面试题
☆─────────────────────────────────────☆
Bayesian1 (Jason) 于 (Tue Aug 30 00:32:06 2011, 美东) 提到:
Given an array A of positive integers. Convert it to a sorted array with
minimum cost. The only valid operation are:
1) Decrement with cost = 1
2) Delete an element completely from the array with cost = value of element
☆─────────────────────────────────────☆
chenpp (chenpp) 于 (Tue Aug 30 00:37:57 2011, 美东) 提到:
my 2 cents:
允许额外花费O(n)空间么。。。
允许的话就不停地减数组中所有元素的值,减一次计数器加1,遇到减到0的就删掉,把
当前计数器值放入新开的等大... 阅读全帖
m****s
发帖数: 18160
10
☆─────────────────────────────────────☆
rhapsody ( input type=\"button\" value=) 于 (Sun Dec 12 22:29:36 2010, 美东) 提到:
1 投诉人(ID)
rhapsody
2 投诉对象及职务(限版主)
PDA版版主zher

3 投诉标题
PDA版一文未发被封
4 投诉目标(更改处理决定/更改板规/弹劾板主...)
弹劾板主。
5 投诉理由及证据
被解封后,一文没发就又被封。
这种土匪行为是否史无前例?
这个mitbbs再不管说不过去了。
☆─────────────────────────────────────☆
EUV (奶特都是卖国贼) 于 (Sun Dec 12 22:30:33 2010, 美东) 提到:
别的不说,史无前例是不对的

☆─────────────────────────────────────☆
leopardo (云豹爆) 于 (Mon Dec 13 00:11:32 2... 阅读全帖
D********g
发帖数: 650
11
来自主题: JobHunting版 - 贡献一道G家的面试题
我的code:
先扫一遍找到A的个数和B的个数
然后再扫一遍处理A
再扫一遍处理B
code里处理A和B的算法不太一样,第二种更好一点。另外,有没有包子?
/*input is assumed to end at '\0' and input is assumed to be long enough to
hold the
* transformed string
* */
static char[] deleteADoubleB(final char[] input) {
if (input == null || input.length == 0) {
return input;
}
int aCount = 0, bCount = 0, originalLen = 0;
for (int i = 0; i < input.length; ++i) {
if (input[i] == 'A') {
aCount ... 阅读全帖
l**n
发帖数: 7272
12
来自主题: WashingtonDC版 - 人生, 最好不相见
http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
http://www.w3.org/1999/xhtml">
http://gmpg.org/xfn/11">

音乐快递:【最好不相见】仓央嘉措诗 - 由没有期待发表 - 文学城



阅读全帖
l*****9
发帖数: 9501
13
来自主题: Basketball版 - 虎扑有史以来最有价值的一贴
Your input can't be opened:
VLC is unable to open the MRL '1600.m3u8'. Check the log for details.
Your input can't be opened:
VLC is unable to open the MRL '2400.m3u8'. Check the log for details.
Your input can't be opened:
VLC is unable to open the MRL '3000.m3u8'. Check the log for details.
Your input can't be opened:
VLC is unable to open the MRL '4500.m3u8'. Check the log for details.
Your input can't be opened:
VLC is unable to open the MRL 'duh.m3u8'. Check the log for details.
Your input ... 阅读全帖
d****n
发帖数: 1241
14
来自主题: JobHunting版 - F面经
可以使用编译器在lexing和parsing的时候用的某种技术:recursive descent parsing
http://en.wikipedia.org/wiki/Recursive_descent_parser
下边的代码假设单个的数字也是合法的,比如:
1 合法
(1)合法
(1) + (2) 合法, 等等
#include
#include
#include
#include
using namespace std;
enum TokenKind {
TOK_Unknown = -1,
TOK_End,
TOK_Op,
TOK_LParen,
TOK_RParen,
TOK_Num,
};
static TokenKind getToken(const string &Input, int &Pos)
{
assert(Pos <= Input.length());
char TheChar = Input[Pos];
while (isspace(TheC... 阅读全帖
d****n
发帖数: 1241
15
来自主题: JobHunting版 - F面经
可以使用编译器在lexing和parsing的时候用的某种技术:recursive descent parsing
http://en.wikipedia.org/wiki/Recursive_descent_parser
下边的代码假设单个的数字也是合法的,比如:
1 合法
(1)合法
(1) + (2) 合法, 等等
#include
#include
#include
#include
using namespace std;
enum TokenKind {
TOK_Unknown = -1,
TOK_End,
TOK_Op,
TOK_LParen,
TOK_RParen,
TOK_Num,
};
static TokenKind getToken(const string &Input, int &Pos)
{
assert(Pos <= Input.length());
char TheChar = Input[Pos];
while (isspace(TheC... 阅读全帖
m******e
发帖数: 353
16
来自主题: JobHunting版 - 从水木上看到个数组题
ok, my bad, keep track of range [0, neg) and [numNeg, pos), and do not
rearrange those (since they are already in the correct place)
use [neg, numNeg) and [pos, N) as circular buffer for un-processed elements
#include
#include
#include
using namespace std;
void print(const vector& input) {
for(size_t i = 0; i < input.size(); ++i) {
cout << input[i] << " ";
}
cout << endl;
}
int numNegatives(const vector& input) {
int cnt = 0;
... 阅读全帖
S*******C
发帖数: 822
17
我已经写了一个,请大家看一下还有什么可以改进的地方
package design_a_pizza_maker;
/*
* @ServiceNow onsite
*/
import java.util.Scanner;
import java.util.Timer;
import java.util.TimerTask;
public class PizzaMaker extends Stopwatch{
public static void main(String[] args) {
PizzaMaker pizzamaker = new PizzaMaker();
Scanner sc = new Scanner(System.in);
System.out.println("Input a to add 30 seconds to current baking
schedule");
System.out.println("Input c to cancel current baking schedule");... 阅读全帖
h****n
发帖数: 1093
18
来自主题: JobHunting版 - 明天A家onsite
写了最后那个,没测,大牛测测
void helper(vector > &Input, int i, int j, int n, int m)
{
if(i<0||i>n-1||j<0||j>m-1)
return;

Input[i][j] = -1;

if(i>0&&Input[i-1][j]==1)
helper(Input, i-1, j, n, m);
if(i helper(Input, i+1, j, n, m);
if(j>0&&Input[i][j-1]==1)
helper(Input, i, j-1, n, m);
if(j helper(Input, i, j+1, n, m);
return;
}
int GetAdjArea(vector > input)
{
i... 阅读全帖
l*******0
发帖数: 63
19
想出两种思路,都是O(N)的time复杂度。请看注释。
public class HelloWorld{

//Idea:put every element into its right position. which means input[i]
is placed at input[i]-1. Then if input[i]==0, then i+1 is one missing
number.
//this approach modifies the original array.
//O(N) time
public static void printMissing(int[] input){
for(int i=0;i while(i+1 swap(input, i, input[i]-1);
}
... 阅读全帖
t**********r
发帖数: 2153
20
来自主题: JobHunting版 - 请问如何去除结果里面的重复
这个是过了OJ的code.为了不超时,加了点tweak.看起来没有以前那么好看了.
public static ArrayList> threeSum(int[] inputs) {
if (inputs == null || inputs.length <= 2) {
// throw new IllegalArgumentException("Invalid inputs");
return new ArrayList>();
}
Arrays.sort(inputs);
Set> matchedTriplets = new HashSet Integer>>();
for (int i = 0; i < inputs.length - 2; i++) {
if (inputs[i] > 0... 阅读全帖
A*****o
发帖数: 284
21
来自主题: JobHunting版 - FB onsite面经加求bless
祝LZ拿到offer ~~
顺便献丑贴个email那题自己的完整代码,真心觉得不简单... 我是用了并查集来
统计合并,
请大牛给个简单点的解法吧,面试中是不可能有时间写这种代码的感觉...
#include
#include
#include
#include
#include
using namespace std;
/*
第二题是有这么一个class Contact,里面有一个String的name,和一个List
装着email address,是这个Contact有的address,用一个list装着是因为一个人有可
能有多个email,现在给你an array of Contact,比如
#1 John [j**[email protected]]
#2 Mary [m**[email protected]]
#3 John [j**[email protected]]
#4 John [j**[email protected], j**[email protected], j**[email protected]]
#5 Bob [bo... 阅读全帖
A*****o
发帖数: 284
22
来自主题: JobHunting版 - FB onsite面经加求bless
祝LZ拿到offer ~~
顺便献丑贴个email那题自己的完整代码,真心觉得不简单... 我是用了并查集来
统计合并,
请大牛给个简单点的解法吧,面试中是不可能有时间写这种代码的感觉...
#include
#include
#include
#include
#include
using namespace std;
/*
第二题是有这么一个class Contact,里面有一个String的name,和一个List
装着email address,是这个Contact有的address,用一个list装着是因为一个人有可
能有多个email,现在给你an array of Contact,比如
#1 John [j**[email protected]]
#2 Mary [m**[email protected]]
#3 John [j**[email protected]]
#4 John [j**[email protected], j**[email protected], j**[email protected]]
#5 Bob [bo... 阅读全帖
g********t
发帖数: 39
23
来自主题: JobHunting版 - 贡献Rocket Fuel 4 hour online test
贡献刚做的online test,职位是Machine Learning related。
Question 1 / 2 (LaserMaze)
You are standing in a rectangular room and are about to fire a laser toward
the east wall. Inside the room a certain number of prisms have been placed.
They will alter the direction of the laser beam if it hits them. There
are north-facing, east-facing, west-facing, and south-facing prisms. If the
laser beam strikes an east-facing prism, its course will be altered to be
East, regardless of what direction it had been goi... 阅读全帖
M****g
发帖数: 162
24
来自主题: JobHunting版 - 急求rocket fuel 3小时的online test!!!
Question 1 / 2 (LaserMaze)
You are standing in a rectangular room and are about to fire a laser toward
the east wall. Inside the room a certain number of prisms have been placed.
They will alter the direction of the laser beam if it hits them. There
are north-facing, east-facing, west-facing, and south-facing prisms. If the
laser beam strikes an east-facing prism, its course will be altered to be
East, regardless of what direction it had been going in before. If it hits
a south-facing prism... 阅读全帖
d**********o
发帖数: 1321
25
来自主题: WebRadio版 - 潜水员冒泡兼征版友意见
最终版本的compiler测试结果
=================================================
Output of Building User Code
Explode the tar
c-.l
c-.y
scanType.h
makefile
symtab.h
symtab.cpp
emitCode.h
emitCode.cpp
20131214164956-huang-CS445-F13-A5.tar: POSIX tar archive (GNU)
Tests: directory
c-.l: lex description text
c-.y: lex description text
emitCode.cpp: ASCII C++ program text
emitCode.h: ... 阅读全帖
d**********o
发帖数: 1321
26
来自主题: WebRadio版 - 潜水员冒泡兼征版友意见
最终版本的compiler测试结果
=================================================
Output of Building User Code
Explode the tar
c-.l
c-.y
scanType.h
makefile
symtab.h
symtab.cpp
emitCode.h
emitCode.cpp
20131214164956-huang-CS445-F13-A5.tar: POSIX tar archive (GNU)
Tests: directory
c-.l: lex description text
c-.y: lex description text
emitCode.cpp: ASCII C++ program text
emitCode.h: ... 阅读全帖
k*****r
发帖数: 21039
27
装了:
Set up Fcitx for Chinese and Japanese language input on Ubuntu Trusty 14.04
fcitx.pngAfter recently upgrading to Ubuntu 14.04 Trusty Tahr (LTS), I
decided to give Fcitx, the default input method framework on Ubuntu’s
Chinese sister project Ubuntu Kylin, a try and I was pleasantly surprised.
Not only is Fcitx rock-solid and actively developed, it also offers input
methods for Japanese, Korean, Vietnamese and a bunch of other languages in
addition to the default Chinese input methods. Here is ... 阅读全帖
s*****y
发帖数: 897
28
来自主题: JobHunting版 - 问道amazon的面试题
写了好几个小时,终于用差不多brute force得解了,算了1337的几个例子,全部都一
样,但是我是算好了一个result,就return了,其他的就不算了。
速度还行,1337的几个例子都是10-20ms就算好了。
但是算火鸡同学的那个终极测试,真的是算了10分钟还没有好,难道要用公司的server
算.....
#include "stdafx.h"
#include
#include
#include
#include
#include
#include
using namespace std;
void DecreaseKey(hash_map& map, int key)
{
map[key]--;
if(map[key] <= 0)
map.erase(key);
}
int check_hash(hash_map& hash, int key) {
for(hash_map阅读全帖
s*****y
发帖数: 897
29
来自主题: JobHunting版 - 问道amazon的面试题
写了好几个小时,终于用差不多brute force得解了,算了1337的几个例子,全部都一
样,但是我是算好了一个result,就return了,其他的就不算了。
速度还行,1337的几个例子都是10-20ms就算好了。
但是算火鸡同学的那个终极测试,真的是算了10分钟还没有好,难道要用公司的server
算.....
#include "stdafx.h"
#include
#include
#include
#include
#include
#include
using namespace std;
void DecreaseKey(hash_map& map, int key)
{
map[key]--;
if(map[key] <= 0)
map.erase(key);
}
int check_hash(hash_map& hash, int key) {
for(hash_map阅读全帖
a*********0
发帖数: 2727
30
来自主题: JobHunting版 - 问个google面试题
泪奔,我都没调,现在work了,full code
import java.util.*;
public class SimpleRegMatch {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("reg:?");
Scanner in=new Scanner(System.in);
String reg=in.nextLine();

System.out.println("string:?");
String input=in.nextLine();
if(StringMatch(... 阅读全帖
e****e
发帖数: 418
31
我的解法,总觉得用Java写还有更好的。
public class LongestConsecutiveSubsequence {

private int longestLCSStartPos = 0;
private int longestLCSCount = 0;
public Vector lcs(Vector input) {
if( input == null || input.size() < 2 )
throw new RuntimeException( "Invalid input." );

lcs( input, 0 );
if ( longestLCSCount < 2 )
throw new RuntimeException( "lcs length is less than 2." );

Vector r = new Vector阅读全帖
g*******s
发帖数: 490
32
用& | 和 bit shift的方法有,只用& |的还真不知道
unsigned __int32 reversing_bits(unsigned __int32 input)
{
// complixity O(log [no.of.bits]) = O(1)
// On 32 bit machines it takes 5 steps (logical)
// Step 1
// Mask bit positions 0, 2, 4... shift LEFT this masked number by one
// Mask bit positions 1, 3, 5... shift RIGHT this masked number by one
input = (input & 0x55555555) << 1 | (input & 0xAAAAAAAA) >> 1;
// Step 2
// Mask bit positions 01, 45, 89... shift LEFT this masked number by ... 阅读全帖
p*****2
发帖数: 21240
33
来自主题: JobHunting版 - 一道google 面试题
using System;
using System.Text;
using System.Collections.Generic;
public class Calculate
{
private Dictionary ht =new Dictionary();
public Calculate()
{
ht.Add('a', 1);
ht.Add('e', 5);
ht.Add('i', 9);
ht.Add('o', 15);
ht.Add('u', 21);
ht.Add('y', 25);
}
public int Calcu(string input,int start)
{
input=input.ToLower();
int i = start;
while (i < input.Length)
if (!ht.... 阅读全帖
a*****g
发帖数: 13
34
My solution:
1. build a graph by storing "possible next digits" for each digit.
2. dfs each digit in the graph.
#include
#include
using std::vector;
using std::string;
struct Node {
int value;
vector next;
Node(int v) {
value = v;
}
};
void build_tree(vector &input) {
for (unsigned i=0;i for (unsigned j=i+1;j if (input[i].value < input[j].value) {
input[i].next.p... 阅读全帖
m****r
发帖数: 141
35
I am compiling a LaTeX file with 10 chapters and a table of contents. I have
added the following in the first page.
But why is the table of contents still missing?
thanks !!!
Any help will be appreciated.
This is the main file.
\pdfbookmark[1]{TABLE OF CONTENTS}{table}
\tableofcontents
\addtocontents{toc}{\def\protect\@chapapp{}} \cleardoublepage \
phantomsection
\addcontentsline{toc}{chapter}{LIST OF TABLES}
\listoftables
\cleardoublepage \phantomsection \addcontentsline{toc}{chapter}{LIST OF
F... 阅读全帖
m****r
发帖数: 141
36
I am compiling a LaTeX file with 10 chapters and a table of contents. I have
added the following in the first page.
But why is the table of contents still missing?
thanks !!!
Any help will be appreciated.
This is the main file.
\pdfbookmark[1]{TABLE OF CONTENTS}{table}
\tableofcontents
\addtocontents{toc}{\def\protect\@chapapp{}} \cleardoublepage \
phantomsection
\addcontentsline{toc}{chapter}{LIST OF TABLES}
\listoftables
\cleardoublepage \phantomsection \addcontentsline{toc}{chapter}{LIST OF
F... 阅读全帖
w*******y
发帖数: 60932
37
I saw this deal go live yesterday and pulled the trigger last night.AMAZON
LINK:
http://www.amazon.com/Samsung-PN58C500-58-Inch-1080p-Plasma/dp/B00499DU7I/ref=sr_1_2?s=electronics&ie=UTF8&qid=1290443419&sr=1-2
There is a lack on information on the model because it seems to be a black
friday special. You can see it listed as a black friday special on the
samsung website for 1299 (so it's already 100 bucks cheaper than samsung
says). Samsung Website:
http://www.samsung.com/us/video/tvs/PN58C500G2... 阅读全帖
a**********2
发帖数: 340
38
来自主题: JobHunting版 - 一道G家题目
没有仔细验证
typedef pair PAIR;
void getCountArray(vector input)
{
int len = input.size();
vector count(len, 0);
vector input1;
int i;
for( i = 0; i < len; i++)
input1.push_back(PAIR(input[i],i));
vector tmp( len, PAIR(0,0));
MergeSort(input1, 0, len-1, tmp, count);
for( i = 0; i < len; i++)
cout << count[i] ;
cout << endl;
}
void Merge(vector& input, int low, int mid, int high,vector&
tmp
, vector& co... 阅读全帖
a*********0
发帖数: 2727
39
来自主题: JobHunting版 - 问个google面试题
recursion version
boolean StringMatch(String reg, int i, String input, int j){
if(i>=reg.length && j>=input.length){
return true;
}

if(i>=reg.length && j return false;

if(i+1 while(j ){
if(StringMatch(reg, i+2, input, j+1))
retur... 阅读全帖
l***m
发帖数: 339
40
来自主题: JobHunting版 - 罗马转数字,数字转罗马问题
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 =... 阅读全帖
x**z
发帖数: 2437
41
来自主题: NextGeneration版 - Pampers Points - 330 points!
for those lazy moms.
You can install iopus on your firefox:
run these codes will add points automatically!
TAG POS=1 TYPE=A ATTR=TXT:GiftstoGrow
TAG POS=1 TYPE=INPUT:TEXT FORM=NAME:quickcode ATTR=ID:redemption_code1
CONTENT=2BEGINEARNING50
TAG POS=11 TYPE=IMG ATTR=SRC:http://en.giftstogrow.pampers.com/static/images/spacer.gif
TAG POS=1 TYPE=A ATTR=TXT:GiftstoGrow
TAG POS=1 TYPE=INPUT:TEXT FORM=NAME:quickcode ATTR=ID:redemption_code1
CONTENT=GIFTSTOGROW4MOM
TAG POS=11 TYPE=IMG ATT... 阅读全帖
p*****2
发帖数: 21240
42
来自主题: JobHunting版 - 三道 Amazon Onsite Coding 题 (转载)

ArrayList topsort(char[][] input)
{
ArrayList res=new ArrayList();
HashMap hm=new HashMap();

for(int i=0;i for(int j=0;j {
if(input[i][j]!=input[i][j+1])
{
if(!hm.containsKey(input[i][j]))
hm.put(input[i][j], new Letter(input[i][j]));
... 阅读全帖
f******h
发帖数: 45
43
也找工作了一段时间了,从版上学了很多,上周G家面完了,求个bless。
之前的一些都挂了,还在继续找其他的。等定下来之后一定发面经回报本版。
谢谢大家啦!!
1. http://www.mitbbs.com/article_t/JobHunting/32005597.html
1) Implement a simple calculator (+,-,*,/);
2) Implement "+1" for a large integer;
3) How to match Ads to users;
4) How to extract useful information from a forum webpage (list all
kinds of useful signal you can think of)
5) How to detect the duplicate HTML pages (large scale);
6) Find all the paths between two places on Google map;
7)... 阅读全帖
p********n
发帖数: 165
44
来自主题: JobHunting版 - Google onsite 题目求助
Space O(1)
Time O(n)
// Given a string, return the longest substring that contains at most // two
characters.
// solution: scan the string and update the first and second letter's last
occurrence
// indices, and update the solution's start index.
int FindLength(const string& input) {
if (input.size() <= 2) {
return input.size();
}

int solu_start = 0;
int first_end, second_end;
char first = input[0];
char second;
int curr = 1;
while (curr < input.size() && in... 阅读全帖
p********n
发帖数: 165
45
来自主题: JobHunting版 - Google onsite 题目求助
Space O(1)
Time O(n)
// Given a string, return the longest substring that contains at most // two
characters.
// solution: scan the string and update the first and second letter's last
occurrence
// indices, and update the solution's start index.
int FindLength(const string& input) {
if (input.size() <= 2) {
return input.size();
}

int solu_start = 0;
int first_end, second_end;
char first = input[0];
char second;
int curr = 1;
while (curr < input.size() && in... 阅读全帖
B*******1
发帖数: 2454
46
来自主题: JobHunting版 - 探讨IT大公司的hiring bar?
How about this one?
class Interval {
public:
Interval(int start_, int end_): start(start_),end(end_){}
int start;
int end;
};
bool comp(Interval &rhs, Interval &lhs)
{
return (rhs.start == lhs.start ? rhs.end < lhs.end : rhs.start < lhs.start);
}
bool check(vector &input)
{
int left = input[0].start;
int right = input[0].end;
for (int i = 1; i < input.size(); i++) {
if (right < input[i].start) {
return false;
} else {
right = max(input[i].end, right);
}
}
return true;
}
int main()
... 阅读全帖
w*******l
发帖数: 14
47
来自主题: JobHunting版 - Thoughtworks code assessment, aptitude paper.
code assessment是我自己面的。
aptitude paper是从老印论坛扒的。
PROBLEM ONE: TRAINS
Problem: The local commuter railroad services a number of towns in Kiwiland
. Because of monetary concerns, all of the tracks are 'one-way.' That is,
a route from Kaitaia to Invercargill does not imply the existence of a route
from Invercargill to Kaitaia. In fact, even if both of these routes do
happen to exist, they are distinct and are not necessarily the same distance!
The purpose of this problem is to help the railroad p... 阅读全帖
j**7
发帖数: 143
48
来自主题: JobHunting版 - find the first missing positive integer.
public int firstMissingPositive(int[] input) {
// Start typing your Java solution below
// DO NOT write main() function

int length=input.length;
for(int i=0;i {

while (input[i]!=i+1 && input[i]<=length &&input[i]>=1)
{
if(input[i]==input[input[i]-1])
break;
int temp=input[i];
input[i]=input[input[i]-1];
input[temp-1]=temp... 阅读全帖
r*****n
发帖数: 35
49
来自主题: JobHunting版 - 请教个G题目
case class TreeNode(value: Char, var left: Option[TreeNode] = None, var
right: Option[TreeNode] = None)
object TreeBuilder {
//recursive version
def recursive(input: String, start: Int): (Int, Option[TreeNode]) ={
if (start >= input.length) {
(start, None)
} else {
val cur = Some(TreeNode(input(start)))
if (start == input.length - 1) {
(start + 1, cur)
} else {
input(start + 1) match {
case '?' =>
val (loffset, l) = recursiv... 阅读全帖
m****x
发帖数: 2506
50
来自主题: NextGeneration版 - [合集] 宝宝版的人其实大部分都很自私
☆─────────────────────────────────────☆
saintknight (圣骑士) 于 (Fri Apr 8 03:10:55 2011, 美东) 提到:
只顾自己,对别人的宝宝的关心也只限于版上熟id之间。
我发帖问个问题,除了好心的katechang帮忙回答了一下,放了一整天也没人给点input
呵呵,真不知道这个宝宝版的id都是怎么样的。以前常看到宝宝版的求bless贴上首页
,还说bless灵,因此我一直assume这个版的人都很热心,互相关心,事实上不过尔尔
。人性的黑暗一面,自管自,在这里也没有任何的改善。
☆─────────────────────────────────────☆
sheenao0 (sheena) 于 (Fri Apr 8 03:26:07 2011, 美东) 提到:
都是为了宝宝,为什么非要从别人那得点什么呢,大部分版上的MM们听了多难过啊。。
其实有宝宝本来MM们上网时间就不多,至少有热心人回复LZ了,难道不该感恩吗?都是
有宝宝的人了,为什么还不懂得宽容呢。。
☆─────────────... 阅读全帖
首页 上页 1 2 3 4 5 6 7 8 9 10 下页 末页 (共10页)