码迷,mamicode.com
首页 >  
搜索关键字:without    ( 3201个结果
Morris Traversal: 非递归不用栈实现对树的中序遍历
参考:http://www.geeksforgeeks.org/inorder-tree-traversal-without-recursion-and-without-stack/ 1. Initialize current as root 2. While current is not NULL If current does not have left child a)...
分类:其他好文   时间:2014-10-22 14:38:08    阅读次数:187
Mysql insert without auto-increase when duplicate
INSERT INTO video_tag_all(tagname,ctime) SELECT '利物浦',1413954816 FROM video_tag_all WHERE (SELECT last_insert_id(id) FROM video_tag_all WHER...
分类:数据库   时间:2014-10-22 14:15:11    阅读次数:210
[Call Vibrator] How to Enable Outgoing Call Vibration without ROOT
Call Vibrator requires the radio log of phone to detect when outgoing call is answered. But since Android JellyBean(4.1), the permission for radio log...
分类:其他好文   时间:2014-10-22 06:18:03    阅读次数:260
Linked List Cycle 判断一个链表是否存在回路(循环)
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?注意,链表循环并不是尾指针和头指针相同,可能是在中间某一段形成一个环路,所以不能只判...
分类:其他好文   时间:2014-10-21 22:56:24    阅读次数:335
HDU 1686 Oulipo(kmp)
Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: Tout avait Pa...
分类:其他好文   时间:2014-10-21 21:44:00    阅读次数:217
[LeetCode]Reorder List
题目描述:Given a singly linked listL:L0→L1→…→Ln-1→Ln,reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For...
分类:其他好文   时间:2014-10-21 17:20:39    阅读次数:180
leetcode第28题--Divide Two Integers
Divide two integers without using multiplication, division and mod operator.分析:题目意思很容易理解,就是不用乘除法和模运算求来做除法,很容易想到的一个方法是一直做减法,然后计数,超时。在网上找到一种解法,利用位运算,意思是...
分类:其他好文   时间:2014-10-21 02:10:36    阅读次数:185
Palindrome Number
回文数字。玩过回文字符串之后在玩一个回文数字,相比于最长回文字符串的巧妙,这道题目唯一值得称道的地方可能就是那句Do this without extra space,可以说这是这道题目明面上给出的唯一束缚,当然如果要是看了提示的话,会发现输入的整数是有负整数的可能。也就是说还要处理负数的问题,在这...
分类:其他好文   时间:2014-10-21 00:47:55    阅读次数:204
Divide Two Integers
Divide two integers without using multiplication, division and mod operator.分析:不能用乘、除、取模运算,我们可以用的运算还有加、减、位运算。一个比较简单的想法是在dividend上不断减去divisor,知道余数小于div...
分类:其他好文   时间:2014-10-20 21:18:28    阅读次数:183
没有重复字符的子串的最大长度
题目:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters...
分类:其他好文   时间:2014-10-20 21:11:05    阅读次数:203
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!