g********d
发帖数: 4174 | 1 http://blogs.seattleweekly.com/dailyweekly/2012/02/the_title_fi
By Johnathon Fitzpatrick Wed., Feb. 29 2012 at 9:00 AM
Comments (1)
Categories: Gay Marriage
RobMckenna150x120.jpg
Opponents and supporters of same-sex marriage are fighting over the phrasing
of a single paragraph in the war of words to win over voters in the fall
when a referendum on gay marriage comes to a head. The paragraph summarizes
Referendum 74, which puts to a public vote the gay marriage bill Gov. Chris
Gregoire tearfully ... 阅读全帖 |
|
|
t***o
发帖数: 462 | 3 By Rebecca Sinderbrand
CNN
WASHINGTON (CNN) -- In a season when words are weapons, it's the H-bomb of
campaign trail rhetoric -- a word so potent that a single appearance usually
sparks days of cable debate and a sea of news ink.
Sen. Barack Obama says Republicans are using "lies" in their campaign
against him and Sen. Joe Biden.
Sen. Barack Obama says Republicans are using "lies" in their campaign
against him and Sen. Joe Biden.
Click to view previous image
1 of 2
Click to view next image
Lie. |
|
y****t
发帖数: 10233 | 4 脑残就是脑残.
i standby my words.
and i use facts and logic to standby my words. |
|
l****z
发帖数: 29846 | 5 by Rick aka Mr. Brutally Honest
John Hayward is dealing with the Paul Ryan is a liar meme being propagated
by the Obama administration and their willing accomplices in the media:
... both of the key factual points made by Paul Ryan are true: Obama
promised the plant would remain PaulRyanopen if he were placed in charge of
the government, but it didn’t last a year beyond the beginning of his
Administration. If you want to be extremely rigid in your analysis of Ryan
’s remarks, you could say ... 阅读全帖 |
|
l****z
发帖数: 29846 | 6 August 7, 2014 - 7:40 PM
By Patrick Goodenough
(CNSNews.com) – As Iraq’s biggest Christian town fell to the Islamic State
of Iraq and the Levant (ISIS), Rep. Frank Wolf (R-Va.) slammed President
Obama Thursday for “doing nothing” in response to the atrocities being
committed against religious minorities in Iraq, saying it was evident his
past assertions on preventing genocide were hollow.
Pope Francis added his voice Thursday to appeals for urgent international
intervention to help hundreds of t... 阅读全帖 |
|
b*********3
发帖数: 1709 | 7 【 以下文字转载自 Military 讨论区 】
发信人: beijingren3 (), 信区: Military
标 题: 'I don't want to use 4-letter words' 哈哈哈
发信站: BBS 未名空间站 (Tue Jul 26 21:12:24 2016, 美东)
'I don't want to use 4-letter words': Russian FM slams reporter over DNC
leak claims |
|
c****n
发帖数: 1108 | 8 I choose plain over fancy words all day long.
got
every |
|
发帖数: 1 | 9 Trump的铁杆支持者，一直为pussy门捉急，幸好目前看来这事影响不大。
可是刚才上推特闲逛，发现trump N word传疯了, Producer says there is footage
of Trump saying the N word. Trump说了hang the Bitch and F*k N*gger!
很崩溃啊，已经有人断言，Trump 必须 drop out了。这个性质的确严重，怎么办呢。
假如明天video曝光，我觉得trump第一时间道歉，不知道可否挽回影响。 |
|
发帖数: 1 | 10 现在舆论环境下，N word绝对是直接死刑。我觉得最好方法，Trump今晚直接道歉说，
我过去不完美，我说过N word 我说过侮辱妇女的话 我做过一些荒唐事 可是那是过去
我已经改正错误 自从参选以来 我深入黑人社区 看到了他们的痛苦 看到了他们在奥巴
马治理下的苦难 bla bla bla
怎么可以联系到Trump团队 把这些信息传达给他们 trump支持者尽快行动吧
: 不断地有人这么说，川普不用玩了，绝对没有戏了，可川普每一次都是从胜利走
向胜利。
: 脸被打得啪啪响。呵呵！
|
|
T**********e
发帖数: 29576 | 11 很有娱乐性。
In their own words: The story of covering Election Night 2016
by Brian Stelter
January 5, 2017: 5:51 PM ET
This is the story of election night 2016 in the words of more than 20
journalists who were in the field, in the newsrooms, at the anchor desks,
and in the control rooms. The story of how Donald Trump's stunning win was
covered in real time.
http://money.cnn.com/2017/01/05/media/election-night-news-coverage-oral-history/ |
|
p*l
发帖数: 1359 | 12 怎么合作写proposal呢？我有很多公式，实在不喜欢word。合作者都爱用word。给人家
pdf，人家不好编辑。 |
|
T*********r
发帖数: 11175 | 13 1.latex下，格式标准，你用不着拿着鼠标调整
特别是图文，或者方程和文字一起排版地时候
2.你要是文字中很多特殊符号，这要用word不得累死
用tex简单多了
3.word更直观这说法，看个人写作习惯了
比如有人就喜欢只focus on 内容，往下写的
而且习惯了latex的思维习惯的话，看着文字里的特殊字符，也没什么特别的
更何况latex并不是不直观，你写完长的方程，如果担心哪里错了，直接tex一下，生成
dvi，pdf，ps之类马上也就看到了。要么自己写个script要么用现成的texshop或者
winedt
之类，都很容易解决这个问题。
里？ |
|
r****n
发帖数: 709 | 14 For short papers, Word. Thesis, etc, LaTeX. If need to exchanged document
with other ppl, most likely need word. |
|
a*****n
发帖数: 230 | 15 Latex is a more elegant way to write papers. The downside: your mind has to
load a lot more information for it to work.
Word is ugly. But you can write in Word with half of the mental capacity.
This is similar to using R versus SAS in statistical analysis. R is more
elegant but more demanding. SAS can be a mess but you can do in half leisure
state. |
|
G**Y
发帖数: 33224 | 16 word公式输入开发大牛说，
他忘了一个开关，
结果目前word不支持行号
hehe |
|
t**o
发帖数: 67 | 17 Word里输入公式，怎么将文中所有公式改变font大小？
弱问题。
在公式编辑器里有Define Sizes的窗口，比如Full 12 pt, Subscript/Superscript 7
pt. etc.
如果你知道你的公式要和文字font 8搭配，那么在输入公式时，可以用 Size->
Smaller。
现在的问题是，我不知道文字最终要多少大小的字体。
比如我在font 12下输入公式，这时公式有默认的各种字符的大小很搭配。
1个月后，我需要把文字大小设成font 10，那么怎么改变所有公式的font大小呢？
有人说选中文字，然后再用font来改变大小。
这个只对文字有用。公式不改变。
对了，我用的是Word 2003，
MathType Ver. 6.6。
难道最新版本可以一起改变了？ |
|
j**u
发帖数: 6059 | 18 关键是实际需要。要是你老板还有你的合作者都要求你用word，他们才可以修改，甚至
还有专业杂志只接受word，你是不可能坚持使用latex的。在搞生物医学领域，这样的
情况太多了。 |
|
|
b*****d
发帖数: 61690 | 20 latex可以转成word,我当时用的软件要求装mathtype来转. |
|
l*******s
发帖数: 3562 | 21 tex我刚查了，我用的是tex2word.
买了以后给你Email一个EXE文件，直接执行，然后安装。装完了以后你的word就多了一
个打开文件的选择项，可以直接打开latex文件。
公式需要装Mathtype。
基本上可以完成90%的转换。你只需要再做一些细微调整就行了。
给我发包子吧。 |
|
w*******n
发帖数: 65 | 22 公式需要装Mathtype, 是说在WORD里面装Mathtype吗？ |
|
p*l
发帖数: 1359 | 23 大侠，有没有Mac版的tex2word？这个能不能把word转回latex? |
|
w*******n
发帖数: 65 | 24 公式需要装Mathtype, 是说在WORD里面装Mathtype吗？ |
|
M*P
发帖数: 6456 | 25 我是直接export PDF 然后直接拖拽PDF到word文档里，这样default用的最好的分辨率
：正在写NSF PROPOSAL
：因为图太多，只有15页空间，所以图片插入WORD文档以后，尺寸放的比较小， |
|
M*P
发帖数: 6456 | 26 有一个图，PNG格式，用WORD存成PDF之后图就丢了，怎么办？
网上搜说是整个文档里图片的数量有限制，可以关掉，但是mac版的word没有这个选项
。有没有类似情况的？ |
|
t****r
发帖数: 702 | 27 我们field almost exclusively用latex， 绝对比word有效率
Word
respect
los
preparation |
|
s**x
发帖数: 7506 | 28 when you type search words on google, they give a list of hints, what is the
best way to store and search the hint words?
not sure I know the best answer.
thanks ! |
|
l*****a
发帖数: 14598 | 29 首先初始单词/终止单词长度要一致
然后将字典中所有具有相同长度的单词生成N*N matrix
a[i][j]=1 means word[i]can transfer to word[j] with replacing one letter
otherwise a[i][j]=0
so your question changed to whether there is a path
a[start]==> a[end]
do BFS with the matrix to see whether there is a path
了。 |
|
N*****8
发帖数: 253 | 30 careercup上有N个word的解法啊，但是非常不efficent就是了，用trie可能好点。 |
|
N*****8
发帖数: 253 | 31 这题应该用前缀树吧，用后缀树，难道你想每个longword都建树，然后search short
word? |
|
r*********n
发帖数: 4553 | 32 0：aa
1：aabbccaa
2：bb
3：bbc
4：bbbbbb
5：cc
6：ccbb
比如你要判断A = aabbccaa能否由其他词组成：
A[0] = a，所以你在所有words里面做binary search（with respect to the first
char），你发现arr[0]，和arr[1]是由char a开头的
然后在[0,1]里面binary search A[1] = a（with respect to 2nd char），你还是得
到[0, 1]，这个时候因为arr[0]只有2个char，所以你发现arr[0]是A的prefix。
然后在[0 - 6]里面binary search A[2] = b（with respect to 1st char），你得到[
2,3,4]
然后在[2，3，4]里面binary search A[3] = b（with respect to 1st char），你得
到[2,3,4]....
整个思路和MSD string sort是一样的，解释起来比较verbose，你理解了MSD sort，也
就理解这个算法... 阅读全帖 |
|
e***s
发帖数: 799 | 33 在LEETCODE OJ 的一题
You are given a string, S, and a list of words, L, that are all of the same
length. Find all starting indices of substring(s) in S that is a
concatenation of each word in L exactly once and without any intervening
characters.
For example, given:
S: "barfoothefoobarman"
L: ["foo", "bar"]
下面是我的代码，在small case 4ms 通过， big case Time Limit Exceeded，不知道
为什么，求解答。
vector findSubstring(string S, vector &L) {
// Start typing your C/C++ solution below
// DO NOT ... 阅读全帖 |
|
i**********e
发帖数: 1145 | 34 是比较奇怪，但仔细看好规则：
Each intermediate word must exist in the dictionary
start 和 end 都不是 intermediate word，所以字典可有可无。
) { |
|
i**********e
发帖数: 1145 | 35 是比较奇怪，但仔细看好规则：
Each intermediate word must exist in the dictionary
start 和 end 都不是 intermediate word，所以字典可有可无。
) { |
|
A******g
发帖数: 612 | 36 Leetcode OJ里的word ladder, 过了小test，大test第一个就超时了，不解！
用的是BFS算法，请大牛们看看有什么问题，谢谢！
class Solution {
public:
typedef unordered_map > Graph;
bool has_edge(string a, string b) {
if (a.size() != b.size()) {
return false;
}
int diff = 0;
for (int i=0; i
if (a[i] != b[i])
diff++;
}
return diff==1;
}
void build_graph(string &start, string &end, unordered_set阅读全帖 |
|
g***j
发帖数: 1275 | 37 这个经典题目
Given two words (start and end), and a dictionary, find the length of
shortest transformation sequence from start to end, such that:
Only one letter can be changed at a time
Each intermediate word must exist in the dictionary
我理解的就是构建一个图，如果两个单词之间只有一个字母不一样，就有路径，然后找
从start到end的最短路径，是这样的么？
但是，这个说起来容易写起来难啊，面试的时候难道还要写一个最短路径的算法么？
另外，这个图如何构建呢？如何快速的判断两个单词只有一个字母不一样呢？
以前以为很容易，动手开始写了才知道好难，至少不像平时面试的那种20行就可以搞定
的题目
请问是我理解错了，还是有别的更加优化的算法？
谢谢了！ |
|
b****g
发帖数: 192 | 38 你的walk函数的思路是先判断后递归：先判断grid是否被使用过、是否出界、是否跟
word匹配，然后再递归。
我最开始做的时候实现递归后判断，进入函数后在判断本次递归grid是否被使用过、是
否出界、是否跟word匹配。大testcase超时，我看了别人写的才意识到先判断后递归会
节省特别多的时间。 |
|
g***j
发帖数: 1275 | 39 You are given a string, S, and a list of words, L, that are all of the same
length. Find all starting indices of substring(s) in S that is a
concatenation of each word in L exactly once and without any intervening
characters.
For example, given:
S: "barfoothefoobarman"
L: ["foo", "bar"]
You should return the indices: [0,9].
这个题目要求时间复杂度多少？ |
|
y*********0
发帖数: 406 | 40 100G的文本文件，4G内存，4个CPU。写一个程序：列出所有文本文件中的word
frequency,并output到一个最终文件中, 格式为 . 这个最终文件
的size也可能比内存小.
大家有啥建议? |
|
|
s**x
发帖数: 7506 | 42
有了trie，checking a substring is a prefix of any words become very easy,
just traverse the path in the trie.
for example， if no word begins with abc, you do not need to check if abcd，
abcde is in the dictionary or not.
when trie is not used, you have to lookup the dictionary for all substrings
starting a given position.
可以看看boggle puzzle 那题，那题不用trie 好像没法弄。 |
|
k*******r
发帖数: 355 | 43 Find all words from a dictionary that are Y edit distance away.
这个怎么做，最原始的比较all word pairs 是O(kn^2)复杂度，肯定有更快的吧 |
|
n*****7
发帖数: 154 | 44 有个问题是string只能有一个word 还是可以有很多word |
|
g***l
发帖数: 352 | 45 题目：You are given a string, S, and a list of words, L, that are all of the
same length. Find all starting indices of substring(s) in S that is a
concatenation of each word in L exactly once and without any intervening
characters.
For example, given:
S: "barfoothefoobarman"
L: ["foo", "bar"]
You should return the indices: [0,9].
(order does not matter).
为什么[4,12]不满足要求？0,9之间也有别的characters呀？ |
|
f***c
发帖数: 338 | 46 In Python:
def reverseWord(s):
return ' '.join([x[-1::-1] for x in s.split()])
^_^ (Sorry Python is not good for alg. demonstration but good for solution)
In C++:
if we can use strtok lib function, then we get each word from the string.
next for each word do the reverse
Is it good? waiting for comments.
letter |
|
z*********e
发帖数: 10149 | 47 现在会超时，哪个地方应该优化一下？用的BFS
本机上一秒之内就出结果了，应该没有严重的算法问题吧
public List> findLadders(String start, String end, Set
dict) {
List> lastPaths = new ArrayList<>();
if(start == null || end == null) return lastPaths;
dict.add(end);
List top = new ArrayList<>();
top.add(start);
lastPaths.add(top);
if(start.equals(end)) return lastPaths;
int wordLen = start.length();
while(!dict.isEmpty()){ // same as ... 阅读全帖 |
|
a***e
发帖数: 413 | 48 终于有个不让我那么抓狂的题了，我的code如下，从后往前扫，两个指针，只扫一遍，
但不算inplace.
看到的其他inplace的好像要scan两遍，有只扫一遍的inplace的做法吗？
Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
class Solution {
public:
void reverseWords(string &s) {
int len=s.size();
if (len==0) return;
int start=len-1,end=len-1;
while(s[end]==' '&&s[start]==' ')
{
end--;
start--;
}
strin... 阅读全帖 |
|
a***e
发帖数: 413 | 49 我在word ladder里面用的两个queue来存现在的string和下一层的string。看了讨论写
了Word ladder II答案，但是unordered_set 比用queue好在哪里？还是这里用queue也
可以的。。。。。？ |
|
a***e
发帖数: 413 | 50 我自己做出来的非常慢，别人的好的答案很快，但我觉得逻辑很复杂，请问有相同复杂
度更简洁一点的答案吗？多谢！
我的慢答案，自己觉得更好解释。（按我现在水平，难以想象能把快答案在45分钟内搞
出来）
class Solution {
public:
vector findSubstring(string S, vector &L) {
vector res;
int nl=L.size();
if (nl==0) return res;
int nw=L[0].size(), ns=S.size();
if (nw==0||ns
map lmap;
for (int i=0; i
{
lmap[L[i]]++;
}
int j=0;
wh... 阅读全帖 |
|
