码迷,mamicode.com
首页 >  
搜索关键字:assume    ( 1858个结果
王爽<汇编语言>实验十一 (附测试代码)
1 ;名称: letterc 2 ;功能: 将以0为结尾的字符串中的小写字母转变成大写字母 3 ;参数: ds:si指向字符串首地址 4 5 assume cs:code 6 7 data segment 8 db "Beginner's All-purpose Symboli...
分类:编程语言   时间:2014-12-19 17:06:49    阅读次数:280
Compare Version Numbers
Compare two version numbers version1 and version1. If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0. You may assume that the version strings are non-empty and co...
分类:其他好文   时间:2014-12-18 20:47:40    阅读次数:236
汇编字符显示
1 DSEG SEGMENT 2 3 DATA DW 0A93EH 4 5 DSEG ENDS 6 CSEG SEGMENT ;设置代码段 7 ASSUME CS:CSEG,DS:DSEG 8 STA...
分类:其他好文   时间:2014-12-18 16:41:55    阅读次数:195
Longest Palindromic Substring(最长回文子串)
题目描述:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique l...
分类:其他好文   时间:2014-12-17 16:10:40    阅读次数:167
[leetcode] Compare Version Numbers
问题描述: Compare two version numbers version1 and version1. If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0. You may assume that the version strings are non-empt...
分类:其他好文   时间:2014-12-16 19:16:58    阅读次数:133
【LeetCode】3Sum Closest
题目 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 ha...
分类:其他好文   时间:2014-12-14 17:19:15    阅读次数:158
LeetCode Longest Palindromic Substring
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-12-14 00:38:30    阅读次数:161
【LeetCode】Insert Interval
Insert IntervalGiven a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals...
分类:其他好文   时间:2014-12-11 22:02:05    阅读次数:218
小小递归程序
求n的阶乘,键盘输入n,结果存储在AX中。 1 DATA SEGMENT 2 3 DATA ENDS 4 STACK1 SEGMENT STACK 5 DB 50H DUP(0) 6 STACK1 ENDS 7 CODE SEGMENT 8 ASSUME CS:CODE,DS:DA...
分类:其他好文   时间:2014-12-11 01:28:34    阅读次数:193
FZU2109:Mountain Number(数位DP)
Problem Description One integer number x is called "Mountain Number" if: (1) x>0 and x is an integer; (2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a[0] is positive). Any a[2i+1] is larger o...
分类:其他好文   时间:2014-12-10 16:18:23    阅读次数:129
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!