码迷,mamicode.com
首页 >  
搜索关键字:could only be replic    ( 14114个结果
Rotate Image
You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?classSolution{publi...
分类:其他好文   时间:2014-06-04 20:25:09    阅读次数:227
Valid Sudoku
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 ...
分类:其他好文   时间:2014-06-04 20:21:51    阅读次数:246
Linux filesystem structures.
1. / – RootEvery single file and directory starts from the root directory.Only root user has write privilege under this directory.Please note that /ro...
分类:系统相关   时间:2014-06-04 20:04:22    阅读次数:416
Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number...
分类:其他好文   时间:2014-06-04 18:58:39    阅读次数:277
Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2...
分类:其他好文   时间:2014-06-03 14:06:24    阅读次数:271
Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n...
分类:其他好文   时间:2014-06-03 14:00:56    阅读次数:281
Sum Root to Leaf Numbers
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep...
分类:其他好文   时间:2014-05-30 16:32:52    阅读次数:226
Best Time to Buy and Sell Stock
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类:其他好文   时间:2014-05-30 16:30:00    阅读次数:282
Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana...
分类:其他好文   时间:2014-05-30 16:24:31    阅读次数:222
Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil...
分类:其他好文   时间:2014-05-30 16:17:49    阅读次数:210
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!