码迷,mamicode.com
首页 >  
搜索关键字:leetcode happy numbe    ( 36157个结果
【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 digit. Add the two numbers and return it as a link...
分类:其他好文   时间:2014-05-23 07:43:23    阅读次数:246
leetcode -day19 Convert Sorted List to Binary Search Tree
1、 ?? Convert Sorted List to Binary Search Tree  Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 分析:将一个升序排列的链表转换为平衡二叉搜索树,采用递归的方式,先找到链表...
分类:其他好文   时间:2014-05-22 12:33:30    阅读次数:270
[LeetCode]Remove Nth Node From End of List
Remove Nth Node From End of List删除链表倒数的第N个元素...
分类:其他好文   时间:2014-05-22 11:15:52    阅读次数:170
LeetCode: Valid Sudoku [035]
【题目】 Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character '.'. A partially filled sudoku which is valid. Note: A valid Sudoku board (par...
分类:其他好文   时间:2014-05-22 09:58:54    阅读次数:234
[LeetCode]Letter Combinations of a Phone Number
Letter Combinations of a Phone Number DFS BFS...
分类:其他好文   时间:2014-05-22 09:23:16    阅读次数:267
leetCode解题报告5道题(十一)
5道题目分别是:【Subsets】、【Subsets II】、【Unique Paths】、【Unique Paths II】、【Trapping Rain Water 】,由于有一些题目不需要发一整篇博文来记录,所以就将这些题目以一篇博文5道来记录。...
分类:其他好文   时间:2014-05-22 08:35:03    阅读次数:348
LeetCode: Sudoku Solver [036]
【题目】 Write a program to solve a Sudoku puzzle by filling the empty cells. Empty cells are indicated by the character '.'. You may assume that there will be only one unique solution. A sudoku puzzle... ...and its solution numbers marked in red. ...
分类:其他好文   时间:2014-05-20 17:07:34    阅读次数:335
LeetCode:Single Number II
题目:     Given an array of integers, every element appears three times except for one. Find that single one.     Note:     Your algorithm should have a linear runtime complexity. Could you implem...
分类:其他好文   时间:2014-05-20 16:22:52    阅读次数:241
POJ 2773 Happy 2006
POJ 2773 Happy 2006 题目大意: 给定m,k,问你第K个与m互质的数是多少? 其中 m (1 <= m <= 1000000), K (1 <= K <= 100000000). 解题思路: 用位运算的容斥原理,计算 [1,x]与m互质的数的方法是: 假设 m的质因数为 a,b,c ,那么与m不互斥的数个数为 f(a)+f(b)+f(c)-f(ab)-f(ac)-fa(bc)+f(abc),f(t)的含义是 (1,x)有多少个数与t不互质,很明显f(t)=x/t,那么与m互...
分类:移动开发   时间:2014-05-20 13:50:30    阅读次数:291
Leetcode:Remove Nth Node From End of List
戳我去解题Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. Aft...
分类:其他好文   时间:2014-05-20 08:04:28    阅读次数:291
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!