码迷,mamicode.com
首页 >  
搜索关键字:assume    ( 1858个结果
转移指令检测题9
补全编程,利用loop指令,实现在内存2000H段中查找第一个值为0的字节,找到后,将它的偏移地址存储在DX中assume cs:codecode segment start:mov ax,2000h mov ds,ax mov bx,0 s: mov cl,[...
分类:其他好文   时间:2014-12-10 14:12:02    阅读次数:211
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-09 13:44:16    阅读次数:210
android 修改设备管理器中的磁盘驱动器名
1)修改F_mass_storage.c中fsg_common_init()的此处代码: snprintf(common->inquiry_string, sizeof common->inquiry_string,    "%-8s%-16s%04x", cfg->vendor_name ?: "Linux",    /* Assume product name dependent on ...
分类:移动开发   时间:2014-12-09 10:37:29    阅读次数:370
LeetCode[Array]: Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times. Examp...
分类:其他好文   时间:2014-12-09 09:25:14    阅读次数:190
[leetcode]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 longest palindromic substring. 基本思想: 本题的navi...
分类:其他好文   时间:2014-12-08 23:04:00    阅读次数:221
Find Minimum in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. You may assume no duplicate exists in ...
分类:其他好文   时间:2014-12-08 15:38:43    阅读次数:141
【LeetCode】Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array....
分类:其他好文   时间:2014-12-08 00:54:38    阅读次数:172
[LeetCode]Construct Binary Tree from Inorder and Postorder Traversal
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-12-05 17:36:45    阅读次数:116
【LeetCode】Insert Interval
题目 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start tim...
分类:其他好文   时间:2014-12-05 15:30:44    阅读次数:207
git 取消/添加 某文件的跟踪
如果我们不小心将某个文件加入了 git 版本控制,但是突然又不想继续跟踪控制这个文件了,怎么办呢?使用git update-index即可。不想继续追踪某个文件git update-index --assume-unchanged your_file_path如果想再次继续跟踪某个文件git upd...
分类:其他好文   时间:2014-12-05 12:15:07    阅读次数:142
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!