e****7
发帖数: 4387 | 1 -- CREATE TABLE STRUCTURE
IF OBJECT_ID('dbo.PEAK', 'U') IS NOT NULL DROP TABLE PEAK
GO
IF OBJECT_ID('dbo.CLIMBER', 'U') IS NOT NULL DROP TABLE CLIMBER
GO
IF OBJECT_ID('dbo.PARTICIPATED', 'U') IS NOT NULL DROP TABLE PARTICIPATED
GO
IF OBJECT_ID('dbo.CLIMBED', 'U') IS NOT NULL DROP TABLE CLIMBED
GO
CREATE TABLE PEAK
(
NAME VARCHAR(255),
ELEV INT,
DIFF INT,
MAP INT,
REGION INT
)
GO
CREATE TABLE CLIMBER
(
NAME VARCHAR(255),
SEX CHAR(1)
)
GO
CREATE TABLE PARTICIPATED
(
... 阅读全帖 |
|
j***o
发帖数: 2842 | 2 我用linux的主要原因是要用latex写文章和slides，emacs具有很多很多软件不具备的
优势，主要是lisp语言的支持，能做很多的智能选择，定义快捷键等，这里就不多说了
linux的主要问题是驱动和一些乱七八糟的问题，还有不能用office系列。如果能安装
emacs在windows上，可以说是一个完美的解决计划。
用下面的方法来安装，就能实现，不建议任何从源码编译的安装方法，太麻烦了。
第一步，安装miktex系统，这个就是latex所需要的所有软件包，很简单，只要等就可
以了，不过，建议你安装完整版本。
第二步，下载emacs系统的binary for windows，地址是
http://ftp.gnu.org/gnu/emacs/windows/
最好安装最新版本：emacs-24.3-bin-i386.zip 是最新版本。解压到c:\program files
\下面，创建一个文件夹emacs-24.3
然后到产生的bin文件夹下运行addpm.exe会在启动文件夹下面安装icon等
第三步，安装gsview和ghostscript，到相应的网站下载安装即可，默认安... 阅读全帖 |
|
j***o
发帖数: 2842 | 3 【 以下文字转载自 Linux 讨论区 】
发信人: jigao (左季高), 信区: Linux
标 题: 在windows系统上安装emacs24
发信站: BBS 未名空间站 (Sun Apr 21 13:20:33 2013, 美东)
我用linux的主要原因是要用latex写文章和slides，emacs具有很多很多软件不具备的
优势，主要是lisp语言的支持，能做很多的智能选择，定义快捷键等，这里就不多说了
linux的主要问题是驱动和一些乱七八糟的问题，还有不能用office系列。如果能安装
emacs在windows上，可以说是一个完美的解决计划。
用下面的方法来安装，就能实现，不建议任何从源码编译的安装方法，太麻烦了。
第一步，安装miktex系统，这个就是latex所需要的所有软件包，很简单，只要等就可
以了，不过，建议你安装完整版本。
第二步，下载emacs系统的binary for windows，地址是
http://ftp.gnu.org/gnu/emacs/windows/
最好安装最新版本：emacs-24.3-bin-i386.zip 是最新版本。解... 阅读全帖 |
|
l*******u
发帖数: 1288 | 4
你指这些？
insert into p_taboo (TID, TABOOWORD) values (134, '老江');
insert into p_taboo (TID, TABOOWORD) values (135, '胡温');
insert into p_taboo (TID, TABOOWORD) values (136, '胡瘟');
insert into p_taboo (TID, TABOOWORD) values (137, '瘟家');
insert into p_taboo (TID, TABOOWORD) values (138, '温夫人');
insert into p_taboo (TID, TABOOWORD) values (139, '温公子');
insert into p_taboo (TID, TABOOWORD) values (140, '胡公子');
insert into p_taboo (TID, TABOOWORD) values (141, '温宝宝');
insert into p_taboo (TID, TABOOWO... 阅读全帖 |
|
S*******C
发帖数: 822 | 5 英文原文
Design database for querying interest/likes of site users.
Assume that number of users is over 6 billion.
下面的答案对吗？
create database usersByInterests;
use usersByInterests;
create table Users(
user_id numeric(10,0) PRIMARY KEY,
email VARCHAR(45) not NULL,
userPassword VARCHAR(45) not NULL,
firstName VARCHAR(45) not NULL,
lastName VARCHAR(45) not NULL
);
create table Interest(
interest_id int PRIMARY KEY,
interest VARCHAR(45) not NULL
);
create table UsersByInterest... 阅读全帖 |
|
r********n
发帖数: 7441 | 6 实话实说，绝大部分靠谱
不过这个程序员该炒了，这种静态的文本识别方式哪行啊
insert into p_taboo (TID, TABOOWORD) values (408, '炸药制作方法');
insert into p_taboo (TID, TABOOWORD) values (411, '制作炸弹首先要制作炸药');
insert into p_taboo (TID, TABOOWORD) values (412, '恐怖分子 第一步 炸弹');
insert into p_taboo (TID, TABOOWORD) values (413, '恐怖分子必备');
insert into p_taboo (TID, TABOOWORD) values (420, '出售手枪 电话');
insert into p_taboo (TID, TABOOWORD) values (421, '出售手枪 手机');
insert into p_taboo (TID, TABOOWORD) values (422, '枪 货到付款');
insert into p_taboo (TI... 阅读全帖 |
|
f*******8
发帖数: 1430 | 7 这个法案是CT的参议员Lieberman提出的，这个法案总共三个部分：第一和第三部分都
不是关于绿卡，而是关于工作签证的，第二部分是关于EB类的绿卡，不过这个法案并没
有增加EB类的绿卡名额，而只是允许提前交I-485(交500美元处理费)和签发有效期为三
年的EAD和AP. 这实际上是个很moderate的改革，可惜当时没有通过。现在把法案贴出
来, 我觉着今年有可能会有议员提相类似的法案:
S.1397 -- Skilled Worker Immigration and Fairness Act (Introduced in Senate
- IS)
S 1397 IS
110th CONGRESS
1st Session
S. 1397
To increase the allocation of visas for certain highly skilled workers and
to reduce fraud and abuse in certain visa programs for aliens working
temporarily in the United Sta... 阅读全帖 |
|
g****g
发帖数: 1828 | 8 SGI Logo
vector
Category: containers Component type: type
Description
A vector is a Sequence that supports random access to elements, constant
time insertion and removal of elements at the end, and linear time insertion
and removal of elements at the beginning or in the middle. The number of
elements in a vector may vary dynamically; memory management is automatic.
Vector is the simplest of the STL container classes, and in many cases the
most efficient.
Example
vector V;
... 阅读全帖 |
|
e********r
发帖数: 2352 | 9 在本地的考试中心预约的上机考试。考试有三个部分，1.数学题，2.给出一种新的编程
语言的语法，回答相应问题，3. Programming Test 要求速度和准确性both important
Programming test 答得不好，肯定不行了，把面试题发上来让大家做做。做了3个半小
时，快累死了。
数学题基本上就是脑筋急转弯，举几个例子
1. You have three kinds of magazines, all but two are Times, all but two are
Science, all but two are Nature. How many magazines in total do you have?
3 books
2. Only one of the answers is true
A. All of the below are true
B. All answers are true
C. One of the above is true
D. All of the above are true
E. None of the above ar... 阅读全帖 |
|
H******7
发帖数: 34403 | 10 一百亿个安慰小段子，今天先发200个
1. No one can prepare you for a loss; it comes like a swift wind. But take
comfort in knowing that he/she is now resting in the arms of our Lord. Our/
My deepest condolences to you and your family.
2. When we lose a loved one here on earth, we gain an angel in heaven that
watches over us. May you take comfort in knowing that you have an angel to
watch over you now. We/I extend our/my most sincere condolences to you.
3. I/We am/are deeply saddened by the loss of your (insert re... 阅读全帖 |
|
f*******t
发帖数: 7549 | 11 这个是很基本的数据结构，建议看一下wiki
我前几天实现了它，只有基本的insert和search，没有对查找child list进行优化，代
码贴出来供参考：
#include
#define MAX_LENGTH 64
using namespace std;
static char buff[MAX_LENGTH];
class Trie {
public:
Trie();
Trie(char value);
bool Insert(const char *str);
bool Search(const char *str) const;
void PrintAll(int pos) const;
private:
char _value;
Trie *_sibling;
Trie *_child;
};
Trie::Trie()
{
_value = 0;
_sibling = NULL;
_child = NULL;
}
Trie::Trie(char value)
... 阅读全帖 |
|
e****7
发帖数: 4387 | 12 --create table #t (
-- ID INT,
-- DNO INT,
-- SAL MONEY
-- )
--INSERT INTO #t VALUES(1,1,1)
--INSERT INTO #t VALUES(1,3,1)
--INSERT INTO #t VALUES(1,5,1)
--INSERT INTO #t VALUES(1,6,1)
--INSERT INTO #t VALUES(2,1,1)
--INSERT INTO #t VALUES(2,2,1)
--INSERT INTO #t VALUES(2,3,1)
--INSERT INTO #t VALUES(2,4,1)
--INSERT INTO #t VALUES(3,2,1)
--INSERT INTO #t VALUES(3,3,1)
--INSERT INTO #t VALUES(3,4,1)
--INSERT INTO #t VALUES(3,5,1)
--INSERT INTO #t VALUES(3,6,1)
--INSERT INTO #t VAL... 阅读全帖 |
|
d*******n
发帖数: 109 | 13 create table table1 (id int , description varchar(20))
insert into table1 values (1, '0-2')
insert into table1 values (2, '2-5')
insert into table1 values (3, '5-10')
insert into table1 values (4, 'more than 10')
create table table2 (userid int, id int)
insert into table2 (userid, id) values (1,1)
insert into table2 (userid, id) values (2,NULL)
insert into table2 (userid, id) values (3,4)
insert into table2 (userid, id) values (4,3)
insert into table2 (userid, id) values (5,NULL)
insert into tab... 阅读全帖 |
|
l******b
发帖数: 39 | 14
Q1, Q2, C ... 都是set, TableA, TableB对应的set为A,B
Q1 = {
select *
from TableA a
left outer join TableB b on a.id = b.id
where a.flag = 1};
Q2 = {
select *
from TableA a
left outer join TableB b on a.id = b.id
and a.flag = 1};
C = {
select * from TableA where a.flag = 1};
outer row定义为当任意的A (left join) B 时候, 存在于
A且在于B中不存在对应元素的所有元素的集合.
那么 Q1 = C left join B,
(能否说outer join之后where的作用就是过虑掉了outer rows?)
Q2 = {C left join B} + {outer rows of (C left join B)}
= Q1 + {outer rows of Q1}
故. ... 阅读全帖 |
|
w********m
发帖数: 1137 | 15 有那位大侠知道这道题怎么做吗？
create table Rating(reviewerID int, movieID int, ratingScore int, ratingDate
date);
insert into Rating values(201, 101, 2, '2011-01-22');
insert into Rating values(201, 101, 4, '2011-01-27');
insert into Rating values(202, 106, 4, null);
insert into Rating values(203, 103, 2, '2011-01-20');
insert into Rating values(203, 108, 4, '2011-01-12');
insert into Rating values(203, 108, 2, '2011-01-30');
insert into Rating values(204, 101, 3, '2011-01-09');
insert into Rating values(205,... 阅读全帖 |
|
G*******s
发帖数: 4956 | 16 Blinded By Tradition:
An Open Letter to Dave Hunt
Regarding His Newly Published Attack Upon the Reformation, What Love Is This
? Calvinism's Misrepresentation of God
James White
Updated 5/16/02, see bottom of file
Dear Dave,
In the period of time since I finally received my own copy of your book (you
may recall I scanned through it while standing at your table in St. Louis a
t the PFO Conference) I have gone through a number of different emotions. A
t first I was just going to do one Dividing ... 阅读全帖 |
|
G****e
发帖数: 1912 | 17 https://www.theepochtimes.com/scientific-puzzles-surrounding-the-wuhan-novel
-coronavirus_3225405.html
Scientific Puzzles Surrounding the Wuhan Novel Coronavirus
BY YUHONG DONG February 3, 2020 Updated: February 6, 2020FONT BFONT SText
size Print
Analysis
The sudden outbreak of the Wuhan Novel Coronavirus (2019-nCoV) has resulted
in all of China’s Hubei Province and three major cities in Zhejiang
Province being subjected to quarantine. Other nations are anxiously trying
to get their people out o... 阅读全帖 |
|
j*j
发帖数: 5564 | 18 给个简单点的version:
public Node insertInOrder(Node head, Node insert) {
if (head == null) {
if (insert != null)
insert.next = null;
return insert;
}
if (insert == null)
return head;
if (insert.data < head.data) {
insert.next = head;
return insert;
}
Node cur = head;
while (cur.next != null)
{
if (cur.next.data > insert.data)
{
Node tmp = cur.next;
cur.next = insert;
insert.ne |
|
T****U
发帖数: 3344 | 19 这应该是烙印的版本，给两个100的vectors
http://www.geeksforgeeks.org/print-binary-tree-vertical-order/
后面问答区一个烙印贴的
vector v1[100];
vector v2[100];
void VerticalOrder(struct BstNode* root, int index) {
if(!root) return;
if(index < 0) {
v1[-1*index].push_back(root->data);
}
else {
v2[index].push_back(root->data);
}
VerticalOrder(root->left, index - 1);
VerticalOrder(root->right, index + 1);
}
int main()
{
struct BstNode* root = NULL;
root = insert(roo... 阅读全帖 |
|
T****U
发帖数: 3344 | 20 这应该是烙印的版本，给两个100的vectors
http://www.geeksforgeeks.org/print-binary-tree-vertical-order/
后面问答区一个烙印贴的
vector v1[100];
vector v2[100];
void VerticalOrder(struct BstNode* root, int index) {
if(!root) return;
if(index < 0) {
v1[-1*index].push_back(root->data);
}
else {
v2[index].push_back(root->data);
}
VerticalOrder(root->left, index - 1);
VerticalOrder(root->right, index + 1);
}
int main()
{
struct BstNode* root = NULL;
root = insert(roo... 阅读全帖 |
|
A*********1
发帖数: 813 | 21 布尿布既环保又对娃的屁股有好处，所以出生之前就决定给娃用布尿布了，做了一些
research，看了很多网上的文章。不过因为娃提前出来，加上朋友送了一箱一号的尿布
，我自己也买了一箱Newborn的，所以是两箱纸尿布用完了以后再上的布尿布。
1）布尿布需要的装备
布尿布。
我选了amazon评论还不错的一个便宜牌子Alvababy，并根据他们评论的建议直接去网站
买的。我刚开始是所有的各样买了一个，然后找出自己最喜欢的。布尿布的cover有AIO
，A12，pocket diaper等等。AIO是把尿布缝在里面的，我试了觉得不好干。我最喜欢
的就是普通的pocket diaper，把insert塞在pocket里面，换的时候就跟纸尿布一样的
用法。
insert也有很多种，我也都试了一下，喜欢一个charcoal bamboo五层的insert，吸水
不错，干的也快。再后来就又定了一拨，只买pocket的，一个尿布加charcoal bamboo
五层的insert是6.79。网站是有美国section，式样要少一些。反正价钱一样，不如直
接从各种选。mink的和普通防雨布的都还不错。我... 阅读全帖 |
|
b******r
发帖数: 111 | 22 Anyone has experience of inserting 9kb in a 8.4kb vector? 2 months was gone
,but I get nothing. Would
you like to take a look a this protocol and give me some suggestion ?
Thanks a lot
Purpose: Insert 9kb mouse sequence into vector pPNT6.
Vector pPNT6: Its map is at http://www.addgene.org/pgvec1?
f=c&identifier=11072&atqx=pnt6&cmd=findpl . I have inserted 0.9kb DNA in
this vector at XhoI/EcorI
double sites. I should have no problem in cloning short fragment.
Insert DNA is 9kb.I have cloned t... 阅读全帖 |
|
N******t
发帖数: 43 | 23 贴代码，如有错误，请私信。
/**
* Implement insert and delete in a trinary tree.
*
*/
public class TrinaryTree {
/**
* define a trinary tree's node
*
*/
static class TreeNode{
public int val; // node's value
public TreeNode left, right, mid; // represent left, right, middle
node
public TreeNode(int v){
this.val = v;
left = null;
right = null;
mid = null;
}
}
TreeNode root;
public TrinaryTre... 阅读全帖 |
|
h****t
发帖数: 22 | 24
首先声明，我是作应用程序开发的，在这个版上贴query是在班门弄斧，让大家见笑了。
CREATE TABLE table1(id int,InheritedFromID int)
CREATE TABLE table2(id int,prop1 nvarchar(50),prop2 nvarchar(50))
CREATE TABLE table3(id int,prop1 nvarchar(50),prop2 nvarchar(50))
insert into table1 (id,InheritedFromID) values(1,0)
insert into table1 (id,InheritedFromID) values(2,1)
insert into table1 (id,InheritedFromID) values(3,2)
insert into table2(id,prop1,prop2) values(1,'a0','a1')
insert into table2(id,prop1,prop2) values(1,'a2','a3')
insert into... 阅读全帖 |
|
k*z
发帖数: 4704 | 25 --table设计的有问题，首先应该给员工分配ID,防止重名，其次给时间加timestamp防止一天多次评级。再有就是
--初学者，练习练习，还能优化么？ 应该不用分析函数，子函数也没必要。
drop table stock;
create table stock (
stock_ticket varchar2(5) ,
analyst_name varchar2(25),
rating_date date,
rating_name varchar2(10)
)
;
insert into stock values ('F','Tim','1-Dec-2010','Sell');
insert into stock values ('F','Tim','1-May-2009','Sell');
insert into stock values ('G','Abramson','6-Sep-2009','Hold');
insert into stock values ('G','Abramson','1-Oct-2010','Sell');
insert into stock valu... 阅读全帖 |
|
k*z
发帖数: 4704 | 26 再次请师傅们评价。
drop table stock;
create table stock (
stock_ticket varchar2(5) ,
analyst_name varchar2(25),
rating_date date,
rating_name varchar2(10)
)
;
insert into stock values ('F','Tim','1-Dec-2010','Sell');
insert into stock values ('F','Tim','1-May-2009','Sell');
insert into stock values ('G','Abramson','6-Sep-2009','Hold');
insert into stock values ('G','Abramson','1-Oct-2010','Sell');
insert into stock values ('E','Abramson','1-Mar-2010','Sell');
insert into stock values ('G','Johns','5-Dec-... 阅读全帖 |
|
l******b
发帖数: 39 | 27
俺来班门弄斧一下, 看这样行不行?
为简化起见, 根据OP的要求, 先建两张表,一张放数据, 一张放参数.
CREATE TABLE t7(
CATEGORY INT,
ID INT,
num int
);
INSERT INTO t7(CATEGORY, ID, num) VALUES(1,1,2) ;
INSERT INTO t7(CATEGORY, ID, num) VALUES(1,2,1) ;
INSERT INTO t7(CATEGORY, ID, num) VALUES(1,3,6) ;
INSERT INTO t7(CATEGORY, ID, num) VALUES(1,4,3) ;
INSERT INTO t7(CATEGORY, ID, num) VALUES(1,5,5) ;
INSERT INTO t7(CATEGORY, ID, num) VALUES(2,1,2) ;
INSERT INTO t7(CATEGORY, ID, num) VALU... 阅读全帖 |
|
l******b
发帖数: 39 | 28
and
times
首先,我不是大牛啊.大牛是Beijing ...
但是,我可以跟你探讨一下这个问题的解法.
为了说明我的思路, 我先建个表, 然后往里面插入10条记录.
create table t10(time int, score int);
insert into t10(time, score) values(1,25);
insert into t10(time, score) values(2,16);
insert into t10(time, score) values(3,50);
insert into t10(time, score) values(4,29);
insert into t10(time, score) values(5,45);
insert into t10(time, score) values(6,64);
insert into t10(time, score) values(7,44);
insert into t10(time, score) values(8,62);
insert into t10(time, score) ... 阅读全帖 |
|
x******a
发帖数: 6336 | 29 ／／main（）
#include
#include
#include "linkedlist.h"
int main()
{
LinkedList myList(5, "luke");
Iterator myIterator=myList.begin();
myList.insert(myIterator, "leia");
myIterator.forward();
myList.erase(myIterator);
myList.insert(myIterator, "chewbca"); 《＝＝＝＝＝＝出问题。
myList[2]="han";
for (int i=0; i
std::cout<
}
myList.insert(myIterator, "chewbca"); 《＝＝＝＝＝＝出问题。
这一句运行起来ta... 阅读全帖 |
|
M*****M
发帖数: 20 | 30 同意!
如果像leetcode insert interval里区间vector已经排序，不用创建新vector， 只需
一步erase 和 insert， O(n)
vector insert(vector &intervals, Interval
newInterval) {
auto start = intervals.begin();
auto it= start;
for(; it !=intervals.end(); ++it) {
if(newInterval.endstart) {
//insert newinterval here
//before insertion, erase prev intervals which are already
merged to newinterval
it = intervals.erase(start,... 阅读全帖 |
|
U***A
发帖数: 849 | 31 看看这个可以不？
vector DNA10letter(string &s){
map mp_itoc;
mp_itoc.insert(make_pair(0,'A'));
mp_itoc.insert(make_pair(1,'C'));
mp_itoc.insert(make_pair(2,'G'));
mp_itoc.insert(make_pair(3,'T'));
map mp_ctoi;
mp_ctoi.insert(make_pair('A',0));
mp_ctoi.insert(make_pair('C',1));
mp_ctoi.insert(make_pair('G',2));
mp_ctoi.insert(make_pair('T',3));
vector result;
... 阅读全帖 |
|
l*********e
发帖数: 5385 | 32 ☆─────────────────────────────────────☆
Jinxu123 (Jinxu) 于 (Thu Feb 28 01:25:50 2013, 美东) 提到:
好像大多数娃都用的一次性的纸尿裤吧，我发个帖子看看有没有用布尿布的。
最近不知道怎么搞的，娃老是红屁股，一直都有涂屁屁膏呀。今天婆婆一直给把尿把屎
了，所以几乎没有捂到过小屁屁，但反而更红了。。。突然想用cloth diaper了，希望
能改善一下。看了半天晕了，不知道哪种好，一种是口袋式的，可以把尿片插口袋里，
上面一层会比较干爽；另一种就一cover,看上去里面两头有点布，尿片两头可以插里面
（这样会不会就没那么干爽了？因为尿布直接接触到屁股了）；然后还有什么liner啊
snappi啊，好像很复杂啊。原来以为买个cover垫个尿布就行了，有没有哪个美妈用过
这种Diaper呀？说说到底是怎么用的？
☆─────────────────────────────────────☆
yugon (扫地大婶) 于 (Thu Feb 28 01:28:18 2013, 美东) 提到:
... 阅读全帖 |
|
i*****w
发帖数: 75 | 33 Use Partition and if you have the ID indexed, it should be very fast. Try
the example here and you can change it according to your table structure.
declare @tbl Table(id INT identity, name varchar(30), isActive bit)
insert into @tbl values('Product One', 1)
insert into @tbl values('Product One', 1)
insert into @tbl values('Product One', 1)
insert into @tbl values('Product Two', 1)
insert into @tbl values('Product Two', 1)
insert into @tbl values('Product Three', 1)
insert into @tbl values('Produ... 阅读全帖 |
|
w****x
发帖数: 2483 | 34
靠, 太扯了, 15分钟电面谁TMD 15分钟想的出这个解法, 而且只会c语言的根本很难做, 电面出
这个题的人脑袋没问题吧!!!
没想出这个解法的就是我下面的这种烂code:
string Multiple(string str1, string str2)
{
assert(str1.size() > 0 && str2.size() > 0);
string strRes;
for (int i = str2.size() - 1; i >= 0; i--)
{
int nAdd = 0;
string strCur;
for (int j = str1.size() - 1; j >= 0; j--)
{
int nTmpI = str2[i] - '0';
int nTmpJ = str1[j] - '0';
int nRes = nTmpJ * nTmpI + nAdd;
nAdd ... 阅读全帖 |
|
d*****y
发帖数: 1365 | 35 int numofword(string& S)
{
unordered_set dict;
dict.insert(string("a"));
dict.insert(string("an"));
dict.insert(string("em"));
dict.insert(string("fir"));
dict.insert(string("fire"));
dict.insert(string("ire"));
dict.insert(string("ma"));
dict.insert(string("man"));
vector vNumW(S.size()+1,-1);
... 阅读全帖 |
|
p********r
发帖数: 66 | 36 1. 从四个边是O的位置开始，广度优先搜索相邻的位置是O的，并且标记为R. 这一步用
时O(n^2)
2. 把所有是R的位置标记为O，所有是O的位置标记为X，用时O(n^2)
因为输入是二位矩阵所有，O(n^2)时间复杂度是最好的了。 Java 代码 572ms跑完所有
test case
具体代码如下：
public void solve(char[][] board) {
if(board.length < 3) return;
Stack stack = new Stack();
for(int i = 0; i < board.length; i++){
if(board[i][0] == 'O'){
insert(stack, i, 0);
}
if(board[i].length > 1 && board[i][board[i].length - 1... 阅读全帖 |
|
p**e
发帖数: 533 | 37 好像长传不了超过1M的附件。以下是需要的parts和步骤：
Parts Needed:
• (1) Permeate Pump with mounting clip (P/N 152002)
• (2) Quick Connect Reducer Union (P/N 125037)
• (2) 3” long, 1/4” Blue tubes (P/N 710450)
• (1) 48” long, 1/4” blue tube (P/N 610113)
• (1) 3/8” Quick Connect Union Tee (P/N 225051)
• (1) 3/8” Plug Insert (P/N 164027)
NOTE: The Permeate Pump is equipped with ¼” Quick Connect push-to-
connect fittings.
The pump can be used in RO systems with 3/8” tubing by inse... 阅读全帖 |
|
z**r
发帖数: 17771 | 38 最安全的肯定是用电子加密证书了，但是不是所有的人都会用，有人就喜欢白纸黑字的
签名。可现在大多数文档都是电子版的，每次打印下来，然后再签字，扫描，很麻烦。
俺做了些调查，发现两个方法，可以解决在PDF文件和WORD文件里面签字的问题了。
First, you need to create an image of your signature. You can write it on a
piece of paper, scan the page, and then crop the image file that your
scanner creates Save the image in one of the common image file formats, such
as .bmp, .gif, .jpg, or .png.
1. In Adobe Reader: File->Get Document Signed, then you will see "Sign Now",
you can choose either "Add Text" or "Place ... 阅读全帖 |
|
p**e
发帖数: 533 | 39 给需要的朋友＊
以下是需要的parts和步骤：
Parts Needed:
• (1) Permeate Pump with mounting clip (P/N 152002)
• (2) Quick Connect Reducer Union (P/N 125037)
• (2) 3” long, 1/4” Blue tubes (P/N 710450)
• (1) 48” long, 1/4” blue tube (P/N 610113)
• (1) 3/8” Quick Connect Union Tee (P/N 225051)
• (1) 3/8” Plug Insert (P/N 164027)
NOTE: The Permeate Pump is equipped with ¼” Quick Connect push-to-
connect fittings.
The pump can be used in RO systems with 3/8” tubing by inserting ... 阅读全帖 |
|
d**********o
发帖数: 1321 | 40 hw3b c-.y file
上面这一楼贴了载止hw3b deadline时我match的结果（也就是老师可以以这些不match
的ERROR为借口不给后来我补上的成绩），但是因为当时我还是没有写完，后来感恩节
期间就接着又写了一些，而且hw5是based on hw3 & hw3b的基础上（当我hw5是based
on更好的hw3的结果时，我应该可以得更多的分吧）。
hw4因为写得比较顺利，就不曾保留任何交上去作业的output，没有什么一目了然的结
果是我可以贴在这里的。原本我是想要把自己最的一次作业hw5贴出来的，但那已经是
一个完整的compiler，而且以后我还需要用自己的course project来找工作，所以一定
就不贴最终结果了。那就贴一个hw3b的c-.y文件吧，它集中的hw1、hw2、hw3、 hw3b的
结果，是我自己hw3b *.y文件的最完整版本。这些作业里面也有很多机关一一人为增加
的难度，比如那六七个IO相关的function，不仅traverse tree、build syntax tree的
时候会成为一个考点（把它们作为一个node连在syntax... 阅读全帖 |
|
d**********o
发帖数: 1321 | 41 hw3b c-.y file
上面这一楼贴了载止hw3b deadline时我match的结果（也就是老师可以以这些不match
的ERROR为借口不给后来我补上的成绩），但是因为当时我还是没有写完，后来感恩节
期间就接着又写了一些，而且hw5是based on hw3 & hw3b的基础上（当我hw5是based
on更好的hw3的结果时，我应该可以得更多的分吧）。
hw4因为写得比较顺利，就不曾保留任何交上去作业的output，没有什么一目了然的结
果是我可以贴在这里的。原本我是想要把自己最的一次作业hw5贴出来的，但那已经是
一个完整的compiler，而且以后我还需要用自己的course project来找工作，所以一定
就不贴最终结果了。那就贴一个hw3b的c-.y文件吧，它集中的hw1、hw2、hw3、 hw3b的
结果，是我自己hw3b *.y文件的最完整版本。这些作业里面也有很多机关一一人为增加
的难度，比如那六七个IO相关的function，不仅traverse tree、build syntax tree的
时候会成为一个考点（把它们作为一个node连在syntax... 阅读全帖 |
|
e****7
发帖数: 4387 | 42 --CREATE TABLE #t (
-- ITEMID INT,
-- Date DATE
--)
--GO
--INSERT #t VALUES (1, '01/01/2012')
--INSERT #t VALUES (1, '02/01/2012')
--INSERT #t VALUES (1, '03/01/2012')
--INSERT #t VALUES (1, '04/01/2012')
--INSERT #t VALUES (2, '04/05/2012')
--INSERT #t VALUES (2, '03/06/2012')
--INSERT #t VALUES (2, '02/07/2012')
--INSERT #t VALUES (2, '02/8/2012')
WITH RECORDS AS (
select *, ROW_NUMBER() OVER (partition by ITEMID order by DATE desc) RN
from #t
)
SELECT ITEMID, [1] AS MostRecentDate1,... 阅读全帖 |
|
P********R
发帖数: 1691 | 43 得到一出错信息如下
Msg 8144, Level 16, State 2, Procedure AddLineItem, Line 0
Procedure or function AddLineItem has too many arguments specified.
/* EXECUTE代码如下：*/
EXECUTE AddlineItem @vOrderid, @vPartid, @vQty, @vStr OUTPUT;
IF @vStr = 'Insert failed'
BEGIN
PRINT 'Insert failed'
PRINT 'FAILURE';
RETURN;
END;
ELSE
PRINT 'Insert successed!'
-- ENDIF;
PRINT 'SUCCESS.';
END;
/* the AddLineItem代码如下: */
IF EXISTS (SELECT name FROM SYS... 阅读全帖 |
|
w*r
发帖数: 2421 | 44 怎么发了文看不见？？再来！
-- table setup
CREATE VOLATILE TABLE T
(
ID INTEGER,
STARTDATE DATE,
ENDDATE DATE)
PRIMARY INDEX(ID)
ON COMMIT PRESERVE ROWS;
INSERT INTO T VALUES(1,'2011-12-02','2012-01-16');
INSERT INTO T VALUES(1,'2012-03-04','2012-03-24');
INSERT INTO T VALUES(1,'2012-04-05','2012-04-26');
INSERT INTO T VALUES(1,'2012-04-29','2012-05-06');
INSERT INTO T VALUES(1,'2012-05-14','2012-06-07');
INSERT INTO T VALUES(2,'2012-03-05','2012-07-30');
INSERT INTO T VALUES(2,'2012-08-04','2012-09-15');
INS... 阅读全帖 |
|
l******b
发帖数: 39 | 45 个人认为解决此问题最佳方法window partitioning + cross apply
T-SQL 2012 提供CROSS APPLY比Oracle 11.2(不提供CROSS APPLY)稍胜一筹.
T-SQL method
---------------------------------
CREATE TABLE t9(
acct VARCHAR(20),
status VARCHAR(20),
nDay int
);
INSERT INTO t9(acct,status, nDay) VALUES('Acct1', 'A', 1) ;
INSERT INTO t9(acct,status, nDay) VALUES('Acct1', 'B', 5) ;
INSERT INTO t9(acct,status, nDay) VALUES('Acct1', 'C', 8) ;
INSERT INTO t9(acct,status, nDay) VALUES('Acct1', 'D', 9) ;
... 阅读全帖 |
|
w*******y
发帖数: 60932 | 46 Link:
http://weeklyad.target.com/minneapolis-mn-55403/pages
Link:
http://coupons.target.com/
Target Digital 4x6 prints $0.10
$2.00/20 4x6 Digital Prints - Target Coupon: Coupon
- Final Price: FREE when you buy 20
Buy 10 Participating Weight Watchers Smart Ones Frozen Entrees and Receive a
$5.00 Target Gift Card.
Weight Watchers Smart Ones Frozen Entrees $1.89
$5.00/12 Weight Watchers Smart Ones Products: Coupon
$3.00/10 Weight Watchers Smart Ones: Coupon
$3.00/10 Weight Watchers Smart Ones - 8/7... 阅读全帖 |
|
发帖数: 1 | 47 http://theprepared.com/blog/no-the-2019-ncov-genome-doesnt-actually-seem-engineered-from-hiv/
2019-nCoV genome doesn’t really seem engineered from HIV
A group of bioinformaticians at two prestigious universities in Delhi, India
, published a preprint scientific manuscript on the bioRxiv preprint server
Friday has led many to speculate wildly that 2019-nCoV may have been
deliberately engineered using HIV protein sequences.
The paper, entitled “Uncanny similarity of unique inserts in the 2019-nCoV... 阅读全帖 |
|
t*******e
发帖数: 274 | 48 Question: Insert an element in order into a sorted linked list containing
integer data
Solution:
public Node insertInOrder(Node head, Node insert) {
if (head == null)
return null;
Node previous = head;
Node current = head.next;
if (current == null) {
if (previous.data < insert.data) {
previous.next = insert;
insert.next = null;
return head;
}
else {
insert.next = previous;
return insert;
|
|
e******s
发帖数: 38 | 49 1. 第一个题好像是用一个max-heap做的，就是每次从heap里pop出一个
pair(a[i]+b[j]),然后将 pair(a[i],b[j+1]) 和pair(a[i+1],b[j]) insert到heap里。
但好像需要check是不是重复的pair(a[i],b[j])已经在heap里了。
为避免重复，必须用 个变量J-Max track 目前max-heap中所有pair的最大的j. 如果j
< J_Max, insertpair(a[i+1],b[j])到heap里； 如果j = J_Max, 将 pair(a[i],b[j+1
]) 和pair(a[i+1
],b[j]) insert到heap里, update as J_Max = J_Max+1.
原帖在 http://www.mitbbs.com/article_t0/JobHunting/31840297.html
2.第二个题，用一个best first search, 从二维数组左上角开始search.
maintain 一个priority queue (= min_heap 来实现), heap.... 阅读全帖 |
|
R******1
发帖数: 58 | 50 刚写了一个可以work的，但是感觉效率很低
还是实现了一个find的function
class Solution {
public:
vector > subsetsWithDup(vector &S) {
vector myset = S;
sort (myset.begin(), myset.end());
return subset (myset);
}
vector< vector > subset (vector &S) {
vector < vector > res;
vector < vector > imediate;
vector < vector >::iterator it;
vector temp;
int lastdigit, pre;
if (S.size() == 1... 阅读全帖 |
|
