码迷,mamicode.com
首页 >  
搜索关键字:should be repaired    ( 4956个结果
a letter and a number
描述we define f(A) = 1, f(a) = -1, f(B) = 2, f(b) = -2, ... f(Z) = 26, f(z) = -26;Give you a letter x and a number y , you should output the result of y...
分类:其他好文   时间:2014-11-30 06:14:14    阅读次数:184
LeetCode: Swap Nodes in Pairs 解题报告
Swap Nodes in Pairs Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as...
分类:其他好文   时间:2014-11-29 21:37:39    阅读次数:365
[LeetCode] Single Number 单独的数字
Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity...
分类:其他好文   时间:2014-11-29 14:30:53    阅读次数:108
[label][Chrome-Extension] How to start Chrome Extension's development
Firstly , you should read these two pages. https://developer.chrome.com/extensions/overview https://developer.chrome.com/extensions/getstartedSecondly...
分类:其他好文   时间:2014-11-29 13:05:25    阅读次数:163
[LeetCode] Two Sum 两数之和
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu...
分类:其他好文   时间:2014-11-29 11:48:14    阅读次数:184
Leetcode-Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Solution:...
分类:其他好文   时间:2014-11-29 07:03:53    阅读次数:194
Leetcode-Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should return all...
分类:其他好文   时间:2014-11-29 06:47:54    阅读次数:165
[LeetCode] Text Justification words显示的排序控制
Given an array of words and a lengthL, format the text such that each line has exactlyLcharacters and is fully (left and right) justified.You should p...
分类:编程语言   时间:2014-11-28 17:35:13    阅读次数:221
Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. Y...
分类:其他好文   时间:2014-11-28 16:26:03    阅读次数:129
并发编程资料
参考资料:1 .浅谈Memory Reordering2.透过LINUX内核看无锁编程3.Why the "volatile" type class should not be useddfsdf4.锁的意义spinlock(自旋锁)lock-free(无锁编程)mutex(互斥锁)read_wri...
分类:其他好文   时间:2014-11-28 09:51:45    阅读次数:185
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!