码迷,mamicode.com
首页 >  
搜索关键字:may    ( 5447个结果
[leetcode]Insert Interval
问题描述: Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start time...
分类:其他好文   时间:2014-11-25 23:40:58    阅读次数:248
leetcode : Scramble String
Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation...
分类:其他好文   时间:2014-11-25 23:02:09    阅读次数:229
[LeetCode] Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类:其他好文   时间:2014-11-25 16:00:36    阅读次数:165
Leetcode-Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complet...
分类:其他好文   时间:2014-11-25 14:02:10    阅读次数:175
LeetCode:Evaluate Reverse Polish Notation
题目描述: Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another expression. Some examples: ...
分类:其他好文   时间:2014-11-25 10:53:22    阅读次数:250
Insert Interval
Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially...
分类:其他好文   时间:2014-11-24 20:46:06    阅读次数:180
android AIDL实践之清理应用缓存
1、把下面两个aidl文件放在自己的工程中,自己的项目视为客户端,来实现跨进程通信。 代码如下: 建立包名: /* ** ** Copyright 2007, The Android Open Source Project ** ** Licensed under the Apache License, Version 2.0 (the "License"); ** you may not ...
分类:移动开发   时间:2014-11-24 12:00:26    阅读次数:247
window.close()提示 "script may close only the windows that were opened by it"
window.close(), scripts may not close windows that were not opened by script...
分类:Windows程序   时间:2014-11-24 11:56:00    阅读次数:1561
Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.C++实现代码:#inclu...
分类:其他好文   时间:2014-11-24 11:47:33    阅读次数:281
Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.提交成功的代码:C++实现:#...
分类:其他好文   时间:2014-11-24 11:26:30    阅读次数:251
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!