码迷,mamicode.com
首页 >  
搜索关键字:面试算法    ( 239个结果
【LeetCode-面试算法经典-Java实现】【136-Single Number(只出现一次的数字)】
【136-Single Number(只出现一次的数字)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given an array of integers, every element appears twice except for one. Find that single one.   Note:   Your algorithm should have a...
分类:编程语言   时间:2015-08-18 07:57:37    阅读次数:233
【LeetCode-面试算法经典-Java实现】【137-Single Number II(只字出一次的数字II)】
【137-Single Number II(只出现一次的数字II)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given an array of integers, every element appears three times except for one. Find that single one.   Note:   Your algorithm sh...
分类:编程语言   时间:2015-08-18 07:56:07    阅读次数:249
【LeetCode-面试算法经典-Java实现】【138-Copy List with Random Pointer(拷贝有随机指针的单链表)】
【138-Copy List with Random Pointer(拷贝有随机指针的单链表)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  A linked list is given such that each node contains an additional random pointer which could point to any node in t...
分类:编程语言   时间:2015-08-18 07:55:06    阅读次数:164
【LeetCode-面试算法经典-Java实现】【130-Surrounded Regions(环绕区域)】
【130-Surrounded Regions(环绕区域)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.   A region is captured by flipping all 'O's into 'X'...
分类:编程语言   时间:2015-08-15 06:45:16    阅读次数:117
【LeetCode-面试算法经典-Java实现】【129-Sum Root to Leaf Numbers(所有根到叶子结点组组成的数字相加)】
【129-Sum Root to Leaf Numbers(所有根到叶子结点组组成的数字相加)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.   An example...
分类:编程语言   时间:2015-08-15 06:44:54    阅读次数:114
【LeetCode-面试算法经典-Java实现】【134-Gas Station(加油站问题)】
【134-Gas Station(加油站问题】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  There are N gas stations along a circular route, where the amount of gas at station i is gas[i].   You have a car with an unlimited gas tan...
分类:编程语言   时间:2015-08-15 06:44:26    阅读次数:147
【LeetCode-面试算法经典-Java实现】【120-Triangle(三角形)】
【120-Triangle(三角形)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.   For example, giv...
分类:编程语言   时间:2015-08-14 07:38:58    阅读次数:283
【LeetCode-面试算法经典-Java实现】【125-Valid Palindrome(回文字验证)】
【125-Valid Palindrome(回文字验证)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.   For example,   "A ma...
分类:编程语言   时间:2015-08-14 07:38:55    阅读次数:171
【LeetCode-面试算法经典-Java实现】【121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)】
【121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Say you have an array for which the ith element is the price of a given stock on day i.   If you were only permitt...
分类:编程语言   时间:2015-08-14 07:37:48    阅读次数:196
【LeetCode-面试算法经典-Java实现】【117-Populating Next Right Pointers in Each Node(二叉树链接右指针II)】
【117-Populating Next Right Pointers in Each Node(二叉树链接右指针II)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Follow up for problem “Populating Next Right Pointers in Each Node”.   What if the given tree could b...
分类:编程语言   时间:2015-08-13 07:47:20    阅读次数:156
239条   上一页 1 ... 10 11 12 13 14 ... 24 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!