码迷,mamicode.com
首页 >  
搜索关键字:palindrome numbers    ( 9163个结果
LeetCode:Next Permutation
题目链接Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not pos...
分类:其他好文   时间:2014-06-07 11:10:30    阅读次数:212
swift笔记1-点语法
var firstForLoop = 0for i in 0...3 { firstForLoop += i i}firstForLoop1 两个点代表是左闭右开 即0,1,22 三个点代表全集合 即0,1,2,3func sumOf(numbers: Int...) -> Int { ...
分类:其他好文   时间:2014-06-06 13:57:57    阅读次数:196
leetcode--Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-...
分类:其他好文   时间:2014-06-06 06:57:18    阅读次数:271
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-06-05 14:15:07    阅读次数:221
POJ2109——Power of Cryptography
Power of CryptographyDescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among t...
分类:其他好文   时间:2014-06-04 16:27:41    阅读次数:248
Amicable numbers -- Javascript 实现
问题描述: Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a  b, then a and b are an amicable pair and each ...
分类:编程语言   时间:2014-06-02 12:31:42    阅读次数:298
LeetCode: Add Two Numbers 题解
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类:其他好文   时间:2014-06-01 17:05:44    阅读次数:296
【leetcode】Permutations
问题: Given a collection of numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. 分析: ...
分类:其他好文   时间:2014-06-01 15:04:42    阅读次数:259
POJ 3579- Median
?? Description Given N numbers, X1, X2, ... , XN, let us calculate the difference of every pair of numbers: ∣Xi - Xj∣ (1 ≤ i < j ≤ N). We can get C(N,2) differences through this work, and no...
分类:其他好文   时间:2014-06-01 14:07:56    阅读次数:347
【leetcode】Permutations II
问题: Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [1,1,2], [1,2,1], and...
分类:其他好文   时间:2014-06-01 13:03:12    阅读次数:324
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!