反正切函数的应用Time Limit:1000MSMemory Limit:10000KTotal Submissions:14468Accepted:5227Description反正切函数可展开成无穷级数,有如下公式(其中0 bc-1 = a(b+c) assume b=a+m and c=a....
分类:
其他好文 时间:
2014-08-24 17:58:42
阅读次数:
175
Longest Palindromic Substring
Total Accepted: 17474 Total
Submissions: 84472My Submissions
Given a string S, find the longest palindromic substring in S. You may assume that the maximum l...
分类:
其他好文 时间:
2014-08-24 16:46:02
阅读次数:
190
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类:
其他好文 时间:
2014-08-23 21:35:21
阅读次数:
264
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have
exact...
分类:
其他好文 时间:
2014-08-23 16:51:01
阅读次数:
184
;实验11;把小写字母换成大写字母assume cs:code , ds:datadata segment db "Beginner's All-purpose Symbolic Instruction Code.",0 data endscode segmentstart: ...
分类:
其他好文 时间:
2014-08-21 18:59:14
阅读次数:
224
;实验10;1.显示字符串;表示要用到前面的,8,3数据好麻烦,但是最后还是用了,;不知道push,pop这么多寄存器干嘛,可能是因为题目要求;要保存子程序中要用到的寄存器吧~assume cs:code,ds:datadata segment db 'Welcome to masm!...
分类:
其他好文 时间:
2014-08-21 18:55:04
阅读次数:
237
;实验10;解决除法溢出的问题assume cs:code , ss:stackstack segment dd 0,0,0,0stack endscode segmentstart : mov ax,stack mov ss,ax mov s...
分类:
其他好文 时间:
2014-08-21 18:54:54
阅读次数:
159
原题:
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
思路:和上一题一样,后续我们可以通过最后一个值得到根的值,同样可以通过定位根的值得到左右子树的...
分类:
其他好文 时间:
2014-08-21 17:22:24
阅读次数:
138
How good software makes us stupid?科技是怎样让人变傻的?People assume that iPhones, laptops and Netflix are evidence of progress. In some ways, that's true. A mo...
分类:
其他好文 时间:
2014-08-21 07:21:43
阅读次数:
260
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类:
其他好文 时间:
2014-08-20 22:28:12
阅读次数:
244