w******d
发帖数: 1301 | 1 It was at the time when I just came to the states. I was curious about the
new world and I would like to explore a lot of new things, especially those
things that were forbidden in China. One thing specific is religion. I went
to Christian bible studies and I also would like to learn more about what is
Falun Dafa: For those who don't know Falun Dafa, it is a branch of Buddism,
but it was declared as a cult in China. I knew one of my college-mate was a
Falun Dafa believer, so I started to communi... 阅读全帖 |
|
b*********3
发帖数: 1709 | 2 康州大学两个小白夜里玩游戏校园里自言自语 N Word，被逮捕，美国人说宪法第一条
被违反了
University of Connecticut students Jarred Karal and Ryan Mucaj were arrested
by campus police Monday night and charged with violating a Connecticut hate
crime statute for using a racial slur in an incident captured on video.
One night earlier this month, Karal and Mucaj — both described by police as
white — walked with another individual through the parking lot of a
student apartment complex playing “a game in which they yelled vulgar words
,” accor... 阅读全帖 |
|
m********l
发帖数: 791 | 3 了解这题DFS的话代码简洁而且大测试不超时。
就是想拿这题练习一下BFS的解法，自己吭哧吭哧写的代码超时了，不知道代码中的哪
一步太耗时？大家帮忙看一下，谢谢~
或者其他可以改进的地方大家也不妨指出~
代码如下：
public class Solution {
public static Queue queue = new LinkedList();
public boolean exist(char[][] board, String word) {
if (word.equals("") || word == null)
return true;
if (board == null || board.length == 0)
return false;
int row = board.length;
int col = board[0].length;
String tmp = word; // save c... 阅读全帖 | | |
|
i**********e
发帖数: 1145 | 4 【 以下文字转载自 JobHunting 讨论区 】
发信人: dongfeiwww (feifei), 信区: JobHunting
标 题: [算法] word ladder problem
发信站: BBS 未名空间站 (Mon Jan 24 23:59:22 2011, 美东)
amazon好像出过此题，简单的说，就是一个原始字符串，一个目标串，求最少的变换的
路径，要求每次变化后的词都在一个字典中。
有些人说bfs，还是dijkstra算法？
下面是原题
// http://www.cs.duke.edu/csed/newapt/allwordladder.html
A word ladder is a sequence of words in which each word can be transformed
into the next word by changing one letter. For example, the word ladder
below changes 'lot' to 'log'.
lot dot dog log
This is not... 阅读全帖 |
|
b****b
发帖数: 3 | 5 [广告] Word助手
Microsoft Word 是广泛使用的文字处理软件，它功能强大、界面复杂。但是，
对于普通用户来说，它的界面太复杂，难以掌握，而对于高级用户来说，有些
功能又没有放置在工具栏上，用起来又比较麻烦。此外，它有些参数设置不大
适合于中文文档。
“Word优化专家”就是为了解决这些问题而设计的。它能够：
(1) 改变Word的工具栏，删除一般用户不用的工具按钮，增加常用的工具按钮。
(2) 改变Word新建文档的默认文字样式和页面设置，以适合中文文档。
(3) 调整Word其它参数，方便用户使用。
(4) 帮助解决使用Word中的疑难杂症（例如，删除多余的页眉横线）。
(5) 收集Word常见问题解答(插入符号、粘贴网页等)供您参考
本软件适合于所有Word用户使用。
欢迎您到 http://wordhelper.xiloo.com 来下载试用！
除此之外，Word助手之家还提供“论文写作Word助手”供您试用！
论文写作Word助手(WordHelper)不仅包含了“Word优化专家”的所有功能，
更重要的是，它是针对广大学生和科研工作者利用Word写作科技文档 |
|
d********w
发帖数: 363 | 6 amazon好像出过此题，简单的说，就是一个原始字符串，一个目标串，求最少的变换的
路径，要求每次变化后的词都在一个字典中。
有些人说bfs，还是dijkstra算法？
下面是原题
// http://www.cs.duke.edu/csed/newapt/allwordladder.html
A word ladder is a sequence of words in which each word can be transformed
into the next word by changing one letter. For example, the word ladder
below changes 'lot' to 'log'.
lot dot dog log
This is not the shortest word-ladder between 'lot' and 'log' since the
former can be immediately changed to the latter yielding a word ladder of
length two:... 阅读全帖 |
|
c******a
发帖数: 789 | 7 大小测试都过了
public boolean exist(char[][] board, String word) {
if (board==null || board.length==0 || board[0].length==0) return
false;
for (int i=0; i
for (int j=0; j
if (board[i][j]==word.charAt(0)) {
boolean[][] used = new boolean[board.length][board[0].
length];
used[i][j] = true;
if (walk(board, i, j, word, 1, used)) return true;
... 阅读全帖 |
|
s******t
发帖数: 12883 | 8 【 以下文字转载自 USANews 讨论区 】
发信人: lczlcz (lcz), 信区: USANews
标 题: New York Bans in Schools Words Like: Gun, Dinosaur, War, Disease
发信站: BBS 未名空间站 (Wed Aug 14 16:28:40 2013, 美东)
August 13, 2013 Posted by Warner Todd Huston
Once again, the New York Department of Education is in the word-banning
business and is telling schools to ban dozens of words from use in the class
room and on tests. And why are they banning the words? Because they might
make kids “feel” bad. But, worse, some of the banned words ... 阅读全帖 |
|
R*******e
发帖数: 25533 | 9 据说是新专辑里唯一有歌词的一首。真的跟Life of Pi没关系么。。。？
歌词据说是 David Gilmour 的老婆写的。
http://www.youtube.com/watch?v=Ezc4HdLGxg4
We bitch and we fight
Diss each other on sight
But this thing we do
These times together
Rain or shine or stormy weather
This thing we do
With world-weary grace
We've taken our places
We could curse it or nurse it and give it a name
It's louder than words
This thing that we do
Louder than words
The way it unfurls
It's louder than words
The sum of our parts
The beat of our hearts
Is louder ... 阅读全帖 |
|
l****z
发帖数: 29846 | 10 August 13, 2013 Posted by Warner Todd Huston
Once again, the New York Department of Education is in the word-banning
business and is telling schools to ban dozens of words from use in the class
room and on tests. And why are they banning the words? Because they might
make kids “feel” bad. But, worse, some of the banned words would actually
prevent learning!
One of the banned words, for instance is “slavery.” OK, so how do we
discuss all of American history before the close of the Civil War if w... 阅读全帖 |
|
l*****g
发帖数: 547 | 11 纯属个人感觉。 word 2003.
若讲实用，latex 跟word 没区别。都是写嘛，排版难看不妨碍一流paper。不是挑啊
呵呵。最近被迫用了一段时间word，主要是合作者都是用word，而且都有直接修改
文档的癖好。 所以想写写用latex的态度用word后的感想. (google + 文档）
word 公式没有大家说得那么弱，基本上常用的符号都有快捷健。插入公式也是如此。
如果熟了，多数操作不需要鼠标，速度也很快。
当然公式的宏(我没用过）不知道跟latex比 word 效率如何。
至于公式编号，如果不用mathtype，自己定义编号也很easy. 新的word
公式输入改进了很多，我看别人用，的确是这样。不过兼容性。。微软向来如此，
也不意外。
word 放图是最弱的。不过我见过很多professor 写paper 把图放在最后，算是绕过
这个问题。一些juornal要求把图放最后，所以这个方法也不太差。最后等终稿之后
再一次性放图，如果需要的话。如果只是插图是link 方式，word 文档小很多，
corrupt 的可能性也小很多。当然这种case 如果发给别人，恐怕也是 |
|
w***g
发帖数: 5958 | 12 我觉得LaTeX有下面几个地方比较好，word我学过，但没学会，希望word专家批判：
1. 文章被拒了要换个地方投， 换个template只要改少数几行。word换template能让你
掉层皮。
2. 比较适合字体控。比如说在文中出现的变量名，如果你想换成与正文不同的字体，用
word能累掉一层皮--这是我猜测的。不过最近用google doc写一个东西，几十个变量名
一个一个地换成times斜体，非常frustrating。word可能没这个问题，大家指正。 不过
用word的可能就不会变成字体控了。
3. 交叉引用比较方便。
4. 比较适合和版本管理软件如CVS配合使用。
5. 和gnuplot配合，写个makefile，数据改变了make一下直接就把所有的图都update了
。如果用word, 如果数据变化不大的话就不要改了。
总结一下呢，上面这些都是学生干的活。
LaTex不爽的地方：没有语法检查，没法随处修改(需要一批配套环境），没法批注。修
改和批注是老板干的活。
所以我们这里就是老板力挺word，然后所有的学生坚持用LaTex。
最后一句话，研究做得好才是王道。如果当... 阅读全帖 |
|
b**y
发帖数: 13 | 13 实现代码:
// build hashtable hset
//遍历hset, 判断每个单词是不是复合词
string FindLongestCompositeWord ()
{
uint32 max_word_length = 1; //No composite word length of 1
string longestCompWord ;
hash_set ::iterator hs1_pIter;
for ( hs1_pIter = hset.begin( ); hs1_pIter != hset.end( ); hs1_pIter++ )
{
if (IsCompositeWord(*hs1_pIter))
{
output_word_list.push_back(*hs1_pIter);
if (max_word_length < ((string)*hs1_pIter).length() )
{
max_word_lengt... 阅读全帖 |
|
b**y
发帖数: 13 | 14 实现代码:
// build hashtable hset
//遍历hset, 判断每个单词是不是复合词
string FindLongestCompositeWord ()
{
uint32 max_word_length = 1; //No composite word length of 1
string longestCompWord ;
hash_set ::iterator hs1_pIter;
for ( hs1_pIter = hset.begin( ); hs1_pIter != hset.end( ); hs1_pIter++ )
{
if (IsCompositeWord(*hs1_pIter))
{
output_word_list.push_back(*hs1_pIter);
if (max_word_length < ((string)*hs1_pIter).length() )
{
max_word_lengt... 阅读全帖 |
|
C***U
发帖数: 2406 | 15 我在网上judge large的时候有几个例子出错了 错误的比率很小
我把例子拷贝到我自己机器上答案是对的
不知道为什么
这个是我的code 用recursive写的
bool existHelper(vector > &board, vector > &
indicator, int row, int column, string word, int index){
if(index == word.size()) {
return true;
}
if(row < 0 || row >= board.size() || column < 0 || column >= board[0].
size()) {
return false;
}
if(indicator[row][column]){
return false;
}
if(board[row][column] != word[index]) {
retur... 阅读全帖 |
|
C***U
发帖数: 2406 | 16 我修改了一点点 这个全部通过了
但是我觉得这两个code没区别啊
bool existHelper(vector > &board, vector > &
indicator, int row, int column, string word, int index){
bool result;
if(index == word.size()) {
return true;
}
if(row < 0
|| row >= board.size()
|| column < 0
|| column >= board[0].size()
|| indicator[row][column]
|| board[row][column] != word[index])
{
return false;
}
... 阅读全帖 |
|
c*****u
发帖数: 867 | 17 https://leetcode.com/problems/substring-with-concatenation-of-all-words/
这道题我是用的brute force，所以有时候超时。请问有更好的算法吗？
我的code有几次通过了，耗时200ms，我看最终结果里有很多几十毫秒的。请问那是怎
样的算法呢？
public class Solution {
public List findSubstring(String s, String[] words) {
ArrayList result = new ArrayList();
HashMap wordMap = new HashMap();
HashMap wordCover = new HashMap();
int wordsLen = words.lengt... 阅读全帖 |
|
s*w
发帖数: 729 | 18 发信人: yangguo1220 (yangguo), 信区: JobHunting
标 题: 一道count frequency of all words的面试题
发信站: BBS 未名空间站 (Wed Sep 18 20:44:44 2013, 美东)
100G的文本文件，4G内存，4个CPU。写一个程序：列出所有文本文件中的word
frequency,并output到一个最终文件中, 格式为 . 这个最终文件
的size也可能比内存小.
大家有啥建议?
【 以下文字转载自 JobHunting 讨论区 】
发信人: saw (句子熊), 信区: JobHunting
标 题: Re: 一道count frequency of all words的面试题
发信站: BBS 未名空间站 (Thu Sep 19 02:18:15 2013, 美东)
just practicing c++11 multi-threading and got the following code to try out
your example
problem wi... 阅读全帖 |
|
a***e
发帖数: 413 | 19 写了很久都过不了，15分钟哪里能写完啊？能把思路说清楚就不错了。不知道什么样的
公司和面试官会出这种题。
https://oj.leetcode.com/problems/word-ladder-ii/
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
vector> res;
vector> empty;
queue curLevel;
queue nextLevel;
vector path;
path.push_back(start);
curLevel.push(start);
res.push_back(path);
string word = start;
bool find = false;
int n = word.size();
bo... 阅读全帖 |
|
a***e
发帖数: 413 | 20 写了很久都过不了，15分钟哪里能写完啊？能把思路说清楚就不错了。不知道什么样的
公司和面试官会出这种题。
https://oj.leetcode.com/problems/word-ladder-ii/
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
vector> res;
vector> empty;
queue curLevel;
queue nextLevel;
vector path;
path.push_back(start);
curLevel.push(start);
res.push_back(path);
string word = start;
bool find = false;
int n = word.size();
bo... 阅读全帖 |
|
j***h
发帖数: 32 | 21 文学城看到的：
感谢文学城网友对我们长久以来的支持，“让我们团购吧”（www.rwmtgb.com）推出
March Break “让我们团购吧”史上大酬宾！ 所有优惠码 2014年3月18日前有效
===============Wordly Wise 3000 online 1年会员=======================
最经典的英语母语词汇练习Wordly Wise 3000推出网络版，在包括所有Wordly Wise
3000书的内容基础上，增加了多媒体语音功能！！ Wordly Wise 3000是孩子提高词汇
和写作能力法宝。
Wordly Wise 3000 online 是北美华人最认可的G2-12的词汇练习，这里是使用过
Wordly Wise 3000的父母在Wenxuecity上发表的博客：
http://blog.wenxuecity.com/myblog/12574/201305/13020.html
Wordly Wise 3000 online 1年会员 现只要20美元（包税）， 20% off 史上最低价！
！！
优惠码：wenxuecity201... 阅读全帖 |
|
v***o
发帖数: 87 | 22 Almighty God, Christ of the last days, has expressed a variety of truths. He
leads the whole of mankind with the word, which accomplishes the actual
significance of the Word appearing in the flesh. From Almighty God’s word,
people come to know God’s work, God’s disposition, and what God has and is
, see God’s supremacy, wisdom, and almightiness, and also understand God’s
kind intention for man’s salvation. … In the end, God’s word will show
authority and let all people see that “God is as good a... 阅读全帖 |
|
l********s
发帖数: 358 | 23 我有很多个文件，每个文件中每一行都是一个word。用Hadoop来统计所有的word，和每
个word总共出现的次数。
程序很简单：
Map():
context.write(word, one)
Reduce():
for (IntWritable val : values) {
sum += val.get();
}
context.write(key, new IntWritable(sum));
我的问题是如果我同时想要知道word的总数目，这样我就可以用来计算word出现的频率
。有什么办法我可以在同一个map-reduce的job里面得到word的总数目？（当然，在我
dump out每个word出现的次数后，我可以在建一个map-reduce的job来得到总数目）。 |
|
f****y
发帖数: 879 | 24 Sight Word 是由美国学者E.W.Dolch所列出，在儿童读物上出现频率最高的220个字汇
Sight Word 是基础程度的字，在文本中出现频率高达 60%~85%。
多数 Sight words 发音不符合 Phonics规则。
Sight words 包含各种词类，有些文法、意义抽象，对于英文初学者而言相对较难。
Sight Words (常见字)，是在近年的儿童英语教学上开始普及的一种新概念，也是帮助
孩子们建立英文阅读基础的关键。
================
Sight Words for Kindergarten
the a I
am me my
like can we
go and it
at on to
have is what
one you said
yes no see
come so are
of for she
he look in
here little do
up
Words to be assessed for the 1st 9 weeks:
the a I am
me my go yes
no one
Words to be asses |
|
d******a
发帖数: 32122 | 25 【 以下文字转载自 Military 讨论区 】
发信人: didadida (滴滴嗒嗒), 信区: Military
标 题: 发现Latex比Word明显“省纸”
发信站: BBS 未名空间站 (Sun Dec 4 08:22:05 2016, 美东)
对于突破出版社的篇幅限制很有帮助
我发现，使用同样的字体（比如latin modern或者palatino/asana, 都是latex字体可
以用在word)，同样的字号（12），同样的行间距（double），latex的页数比word少了
大概15%到20%的样子
比如出版社限制在30页，word是35页不行，转latex就绰绰有余。
浏览网页，发现同样的字号，word的字符实际略大，把Word的字号从12改成11.5，
latex维持在12，这样每行的字数就差不多了。但问题在于每页的行数仍然不同，latex
明显每页多了好几行。也就是说两者对双倍行距的定义也是不同的。
另外，latex经常断字，word我查了网络，按照步骤怎么都无法自动断字。自动断字好
处是让每行字符数大致相同，美观。 |
|
w*******n
发帖数: 65 | 26 【 以下文字转载自 Software 讨论区 】
发信人: windgreen (bw), 信区: Software
标 题: 有没有从LATEX文件转WORD，或者从PDF转WORD的好软件/工具？
发信站: BBS 未名空间站 (Mon Jul 2 00:32:23 2012, 美东)
我平时写东西都是用的LATEX工具，可是有些期刊只收WORD格式的提交。从LATEX原文件
手工转到WORD格式文件真是一件耗时痛苦的事，实在不甘心花几天时间在这个过程上，
而如果有好的转换工具，1秒不到就能完成。这件事困扰我已久，以前也花了很多时间
精力在寻找合适的转换软件上，总是无功而返。可是这样的需求以后只会增多，不会减
少。难不成我每次都象蚂蚁一样，一段一段地搬运，一个一个数学符号地重新输入？一
想到这个就抓狂。
这儿平时写文章的同学应该也有不少，有哪位碰到过这样的困扰么？你们是用的什么
LATEX TO WORD或者PDF TO WORD的好软件/工具的呢？可能我找的方法不对，这些年来
从来没有找到过一个好的。
多谢！ |
|
i**********e
发帖数: 1145 | 27 Looks like an interesting problem. I coded a C++ solution using BFS here. The distance between words (Levenshtein distance) is calculated using DP. Anyone who's interested can take a look here:
http://www.ideone.com/enbHZ
The main idea is using BFS (with the help of a queue) to search for the
shortest length ladder word sequence.
Some notes about the code:
- The transformed word (the final word that you want to transform to) must
be in the dictionary.
- "Your code must determine the shortest wor... 阅读全帖 |
|
b**y
发帖数: 13 | 28 求教各位大拿，这道面试题怎么解
Find Longest Word Made of Other Words： Write a program that reads a file
containing a sorted list of words (one word per line, no spaces, all lower
case), then identifies the longest word in the file that can be constructed
by concatenating copies of shorter words also found in the file.
给你一个词典，找出长度最长的复合单词，怎么解呢，先谢谢了 |
|
b**y
发帖数: 13 | 29 求教各位大拿，这道面试题怎么解
Find Longest Word Made of Other Words： Write a program that reads a file
containing a sorted list of words (one word per line, no spaces, all lower
case), then identifies the longest word in the file that can be constructed
by concatenating copies of shorter words also found in the file.
给你一个词典，找出长度最长的复合单词，怎么解呢，先谢谢了 |
|
j******s
发帖数: 48 | 30 Hi,请问word ladder II 的测试数据是不有点问题么？
对于输入:
"hit", "cog", ["hot","cog","dot","dog","hit","lot","log"]
我的输出是
[["hit","hot","dot","dog","cog"],["hit","hot","lot","log","cog"],["hot","dot
","lot","log","cog"],["hot","dot","dog","log","cog"]]
测试数据输出的是
[["hit","hot","dot","dog","cog"],["hit","hot","lot","log","cog"]]
根据题目的定义应该是都可以的吧？
嗯嗯，我知道答案是不是正确不是特别重要，只是这道题我花了很多时间对比BFS,DFS,
IDS以及实现他们的一些不同方式，所以希望可以求证一下而已。
附贴上我的代码
class Solution {
private:
class Node{
public:
string word;
vector阅读全帖 |
|
r**********o
发帖数: 50 | 31 Word Search这题的优化解是？看面经里也有经常考到，但是手边的资料好像只有暴力
解！！
Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell,
where "adjacent" cells are those horizontally or vertically neighboring. The
same letter cell may not be used more than once.
For example,
Given board =
[
["ABCE"],
["SFCS"],
["ADEE"]
]
word = "ABCCED", -> returns true,
word = "SEE", -> returns true,
word = "ABCB", -> returns false.
请大牛出场~~ |
|
h*********2
发帖数: 192 | 32 Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
Clarification:
What constitutes a word?
A sequence of non-space characters constitutes a word.
Could the input string contain leading or trailing spaces?
Yes. However, your reversed string should not contain leading or trailing sp
aces.
How about multiple spaces between two words?
Reduce them to a single space in the reversed string.
基本思路就是先整体reverse string (character per c... 阅读全帖 |
|
h*********2
发帖数: 192 | 33 Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
Clarification:
What constitutes a word?
A sequence of non-space characters constitutes a word.
Could the input string contain leading or trailing spaces?
Yes. However, your reversed string should not contain leading or trailing sp
aces.
How about multiple spaces between two words?
Reduce them to a single space in the reversed string.
基本思路就是先整体reverse string (character per c... 阅读全帖 |
|
w********s
发帖数: 1570 | 34 text justification和dp有毛关系。
class Solution {
public:
string reorder(string& s, int L, int nWords)
{
int diff = L - s.length();
if (nWords == 1)
{
string r = s;
for (int i = 0; i < diff; ++i) r += ' ';
return r;
}
int each = diff / (nWords - 1);
int extra = diff % (nWords - 1);
string r;
int l = s.length();
for (int i = 0; i < l; ++i)
{
... 阅读全帖 |
|
p**p
发帖数: 10318 | 35 Here is the music:
http://myweb.hinet.net/home1/hammer/hoho/045.rm
Here is the lyric:
WORDS
Words ... don't come easy to me
how can I find a way
to make you see I love you?
words don't come easy
Words ... don't come easy to me
This is the only way
for me to say I love you
words don't come easy
Well I'm just a music man
melody's so far my best friend
but my words are coming out wrong
and I ... I reveal my heart to you and
hope that you believe it's true
.... 'cause
Words ... don't come easy to me |
|
j********e
发帖数: 30 | 36 约翰福音第一句话说：
In the begining was the Word, and the Word was with God, and the Word
was God.
我一直很想知道这里的Word究竟指什么。曾经询问过一些精通圣经的人，一个华人
牧师告诉我说Word应该理解为logos或者规律, 一个美国信徒认为应该指authority。这
就算两种比较有代表性的解释吧。
中文翻译中直接把Word译为“道”，原句是“太初有道，道与神同在，道即是神”。我
很犹疑，因为中国人理解的道和基督教所理解的神是不一样的，前者具有神秘性和某种
不可名状的特征，就像道德经中开宗明义讲的“道可道，非常道。名可名，非常名。”
我理解这是说当我们要用语言来阐明道的时候，被阐述出来的东西就失去了永恒性，也
就不是道本身了，所以道是可意会而不可言传的，这几乎可以直接作为上面引文中对于
Word的那种不言而喻和毫不犹豫的肯定判断的解构。这个神秘而模糊的道既不等于
logos（指可以理解的世界的规律），也不能理解为authority.
记得是在“读书”还是在哪里看 |
|
A****i
发帖数: 5546 | 37 http://v.youku.com/v_show/id_XMjU5NDcyMjk2.html
What Are Words
by Chris Medina
Anywhere you are, I am near
Anywhere you go, I'll be there
Anytime you whisper my name, you'll see
How every single promise I keep
Cuz what kind of guy would I be
If I was to leave when you need me most
What are words
If you really don't mean them
When you say them
What are words
If they're only for good times
Then it's on
When it's love
Yeah, you see them as lover's words
They never go away
They live on, even when we... 阅读全帖 |
|
r******p
发帖数: 9 | 38 【 以下文字转载自 Programming 讨论区 】
发信人: roadtrip (dream on), 信区: Programming
标 题: 这个问题怎么做好？(word sqaure)
发信站: BBS 未名空间站 (Fri Sep 16 11:30:36 2005), 转信
A 'word square' is an NxN arrangement of letters which forms words
horizontally and vertically, such as these 5x5 examples:
heart
ember
abuse
resin
trend
Read a dictionary containing 5-letter words then print all
valid 5x5 word squares which can be made from those words.
A square is valid if it contains only words from the dictionary.
how to do it good? |
|
w*******n
发帖数: 65 | 39 【 以下文字转载自 Software 讨论区 】
发信人: windgreen (bw), 信区: Software
标 题: 有没有从LATEX文件转WORD，或者从PDF转WORD的好软件/工具？
发信站: BBS 未名空间站 (Mon Jul 2 00:32:23 2012, 美东)
我平时写东西都是用的LATEX工具，可是有些期刊只收WORD格式的提交。从LATEX原文件
手工转到WORD格式文件真是一件耗时痛苦的事，实在不甘心花几天时间在这个过程上，
而如果有好的转换工具，1秒不到就能完成。这件事困扰我已久，以前也花了很多时间
精力在寻找合适的转换软件上，总是无功而返。可是这样的需求以后只会增多，不会减
少。难不成我每次都象蚂蚁一样，一段一段地搬运，一个一个数学符号地重新输入？一
想到这个就抓狂。
这儿平时写文章的同学应该也有不少，有哪位碰到过这样的困扰么？你们是用的什么
LATEX TO WORD或者PDF TO WORD的好软件/工具的呢？可能我找的方法不对，这些年来
从来没有找到过一个好的。
多谢！ |
|
d******a
发帖数: 32122 | 40 【 以下文字转载自 Military 讨论区 】
发信人: didadida (滴滴嗒嗒), 信区: Military
标 题: 发现Latex比Word明显“省纸”
发信站: BBS 未名空间站 (Sun Dec 4 08:22:05 2016, 美东)
对于突破出版社的篇幅限制很有帮助
我发现，使用同样的字体（比如latin modern或者palatino/asana, 都是latex字体可
以用在word)，同样的字号（12），同样的行间距（double），latex的页数比word少了
大概15%到20%的样子
比如出版社限制在30页，word是35页不行，转latex就绰绰有余。
浏览网页，发现同样的字号，word的字符实际略大，把Word的字号从12改成11.5，
latex维持在12，这样每行的字数就差不多了。但问题在于每页的行数仍然不同，latex
明显每页多了好几行。也就是说两者对双倍行距的定义也是不同的。
另外，latex经常断字，word我查了网络，按照步骤怎么都无法自动断字。自动断字好
处是让每行字符数大致相同，美观。 |
|
w*******y
发帖数: 60932 | 41 2 Free Kindle Games for your Kindle - Every Word and Shuffled Row!
If you like Scrabble, you may like Shuffled Row & if you like word scrambles
, then you will like Every Word! : ) This is kind of nice if you want to
have a little break from reading!
**Not sure, but these may only work on the Kindle 2s, and not the Generation
1 Kindles : (
Every Word LINKY:
http://www.amazon.com/Every-Word/dp/B003P37FW0/ref=cm_lmf_tit_1
Shuffled Row LINKY
Every Word Information:
If you like word scrambles then |
|
w*******y
发帖数: 60932 | 42 Ebay Daily Deal has
Bananagrams Word Game or Pairs in Pears Word Games NEW for $10 SHIPPED.
Banagrams:
Product Description
From the Manufacturer
Bananagrams is a fast and fun word game that requires no pencil, paper or
board. All you need is a table. One hand can be played in as little as five
minutes. It is a great for family fun as well as being educational.
Bananagrams portability makes it perfect for travel. Just grab the pouch and
go.
Product Description
Ages 7 & up. In this unique word gam... 阅读全帖 |
|
w*******y
发帖数: 60932 | 43 Word Seek Social
iOS iPhone
Link:
http://itunes.apple.com/us/app/word-seek-social/id403045577?mt=
Come and join the Word Seek Social Lite crowd! Word Seek Social Lite is the
game for you if you love free social word games or puzzles!
Sharpen your mind, expand your vocabulary, and challenge yourself to solve a
puzzle with this innovative, interactive, and addictive play off a classic
word search game. Youll have tons of fun as you find as many words as
possible online against your friends in this... 阅读全帖 |
|
d******a
发帖数: 32122 | 44 对于突破出版社的篇幅限制很有帮助
我发现，使用同样的字体（比如latin modern或者palatino/asana, 都是latex字体可
以用在word)，同样的字号（12），同样的行间距（double），latex的页数比word少了
大概15%到20%的样子
比如出版社限制在30页，word是35页不行，转latex就绰绰有余。
浏览网页，发现同样的字号，word的字符实际略大，把Word的字号从12改成11.5，
latex维持在12，这样每行的字数就差不多了。但问题在于每页的行数仍然不同，latex
明显每页多了好几行。也就是说两者对双倍行距的定义也是不同的。
另外，latex经常断字，word我查了网络，按照步骤怎么都无法自动断字。自动断字好
处是让每行字符数大致相同，美观。 |
|
a***g
发帖数: 2402 | 45 不得不承认，latex 已经落伍了。
[在 didadida (滴滴嗒嗒) 的大作中提到：]
:对于突破出版社的篇幅限制很有帮助
:我发现，使用同样的字体（比如latin modern或者palatino/asana, 都是latex字体可
:以用在word)，同样的字号（12），同样的行间距（double），latex的页数比word少
了大概15%到20%的样子
:比如出版社限制在30页，word是35页不行，转latex就绰绰有余。
:浏览网页，发现同样的字号，word的字符实际略大，把Word的字号从12改成11.5，
:latex维持在12，这样每行的字数就差不多了。但问题在于每页的行数仍然不同，
latex明显每页多了好几行。也就是说两者对双倍行距的定义也是不同的。
:另外，latex经常断字，word我查了网络，按照步骤怎么都无法自动断字。自动断字好
:处是让每行字符数大致相同，美观。 |
|
l*****o
发帖数: 214 | 46 一点想法，不知到对不对：
用doubly linked list
step 1. scan text, if in the target word set, add to doubly linked list,
until the doubly linked list has all the target words: you get [word1, word1
, word2, word1, word1, word3]
step 2. from the end of the linked list, go backwards, until find all the
words in target word set, remove the words before, and the result is a
probably shorter list with first element A: you get [word2, word1, word1,
word3], and record the span
step 3. keep scanning the text, push wor... 阅读全帖 |
|
c********t
发帖数: 5706 | 47 多谢！
第一题最后发现用 char array 比 StringBuilder还快
第二题又超时了，再求帮助！
用的是双queue解法，感觉比你和wwwyhs说的hashmap>用空间
更少，时间也应该更少，为啥又超呢？（唉，我为什么又说又）
public ArrayList> findLadders(String start, String end,
HashSet dict) {
// Start typing your Java solution below
// DO NOT write main() function
ArrayList> ret = new ArrayList>(
);
int curr=1, next=0, count=1, n=start.length(), length=Integer.MAX_
VALUE... 阅读全帖 |
|
c********t
发帖数: 5706 | 48 多谢！
第一题最后发现用 char array 比 StringBuilder还快
第二题又超时了，再求帮助！
用的是双queue解法，感觉比你和wwwyhs说的hashmap>用空间
更少，时间也应该更少，为啥又超呢？（唉，我为什么又说又）
public ArrayList> findLadders(String start, String end,
HashSet dict) {
// Start typing your Java solution below
// DO NOT write main() function
ArrayList> ret = new ArrayList>(
);
int curr=1, next=0, count=1, n=start.length(), length=Integer.MAX_
VALUE... 阅读全帖 |
|
A****L
发帖数: 138 | 49 这个事我以前开的帖子。
http://www.mitbbs.com/article_t0/JobHunting/32682961.html
代码如下：
public class Solution {
public class Ladder {//Define Ladder class it's important
public ArrayList parentList;
public String word;
public Ladder(String w, Ladder parent) {word=w; parentList = new
ArrayList(); parentList.add(parent);}
}
ArrayList> ladders=new ArrayList>();;
public ArrayList> findLadders(String sta... 阅读全帖 |
|
A****L
发帖数: 138 | 50 这个事我以前开的帖子。
http://www.mitbbs.com/article_t0/JobHunting/32682961.html
代码如下：
public class Solution {
public class Ladder {//Define Ladder class it's important
public ArrayList parentList;
public String word;
public Ladder(String w, Ladder parent) {word=w; parentList = new
ArrayList(); parentList.add(parent);}
}
ArrayList> ladders=new ArrayList>();;
public ArrayList> findLadders(String sta... 阅读全帖 |
|
