码迷,mamicode.com
首页 >  
搜索关键字:reverse nodes    ( 8673个结果
【0031】反转整数/判断回文
Reverse Integer反转一个整数C++ Code1234567891011121314151617181920212223242526272829303132classSolution{public:intreverse(intx){/*一位数的情况*/if(-10=10){div*=10...
分类:其他好文   时间:2014-06-15 20:19:20    阅读次数:196
FI & RI
RI (Reverse Integration) / FI (Forward Integration)RI :child branch => parent branchFI :parent branch =>child branch
分类:其他好文   时间:2014-06-15 16:52:09    阅读次数:216
ISCC2014-reverse
这是我做reverse的题解,在咱逆向之路上的mark一下,,水平有限,大牛见笑。 宗女齐姜 果然是只有50分的难度,OD直接找到了flag.   找到杀手 这题用OD做很麻烦,我改用IDA了,又是秒破 将图中字符串输入,程序生成了四张扑克牌图片,题目让根据密文推断,就4个字符串,一个一个试最多4次就出来了,哈哈     避难母国...
分类:其他好文   时间:2014-06-15 15:31:20    阅读次数:405
【Leetcode】Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,15,7}, ...
分类:其他好文   时间:2014-06-15 15:17:43    阅读次数:192
【Leetcode】Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / 9 20 ...
分类:其他好文   时间:2014-06-15 13:26:54    阅读次数:200
[LeetCode]Swap Nodes in Pairs
Description:Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->...
分类:其他好文   时间:2014-06-15 07:35:31    阅读次数:151
Leetcode:Partition List
Description:Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preser...
分类:其他好文   时间:2014-06-14 19:11:15    阅读次数:173
Leetcode:Binary Tree Zigzag Level Order Traversal
Description:Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next ...
分类:其他好文   时间:2014-06-14 18:41:40    阅读次数:265
leetcode -day29 Binary Tree Inorder Traversal & Restore IP Addresses
1、 ?? Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return ...
分类:其他好文   时间:2014-06-14 14:11:27    阅读次数:315
leetcode--Reverse Linked List II
Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No...
分类:其他好文   时间:2014-06-14 13:15:06    阅读次数:199
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!