码迷,mamicode.com
首页 >  
搜索关键字:example 复杂条件查询    ( 17809个结果
Java 07 example
留下两个例子作为参考,1. 追逐小方块的例子2. HashMap 和 Iterator 的例子Example one:import acm.graphics.*;import acm.program.*;import java.awt.*;import java.awt.event.*;public...
分类:编程语言   时间:2014-06-29 12:16:41    阅读次数:209
LeetCode:First Missing Positive
题目链接 Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algo...
分类:其他好文   时间:2014-06-29 07:44:48    阅读次数:321
LeetCode: Path Sum II [113]
【题目】 Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 / 4 8 / / 11 13 4 ...
分类:其他好文   时间:2014-06-20 10:53:08    阅读次数:181
Binary Tree Inorder Traversal
题目 Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,3,2]. Note: Recur...
分类:其他好文   时间:2014-06-20 10:22:00    阅读次数:221
projecteuler---->problem=20----Factorial digit sum
n! means n (n 1) ... 3 2 1 For example, 10! = 10 9 ... 3 2 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of the digits...
分类:其他好文   时间:2014-06-20 09:34:10    阅读次数:215
LeetCode: Path Sum [112]
【题目】 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree and sum = 22, 5 / ...
分类:其他好文   时间:2014-06-07 13:57:37    阅读次数:210
LeetCode: Flatten Binary Tree to Linked List [114]
【题目】 Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / 2 5 / \ 3 4 6 The flattened tree should look like: 1 2 3 4 \...
分类:其他好文   时间:2014-06-07 11:37:00    阅读次数:153
leetcode--Add Binary
Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".public class Solution { /**The program is us...
分类:其他好文   时间:2014-06-05 14:08:35    阅读次数:188
leetcode--Rotate List
Given a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NULL./** *...
分类:其他好文   时间:2014-06-05 13:44:26    阅读次数:250
leetcode--Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor...
分类:其他好文   时间:2014-06-05 13:41:44    阅读次数:231
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!