码迷,mamicode.com
首页 > 其他好文
Leetcode-Add Binary
Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100".Solution: 1 public class Solution { 2 p...
分类:其他好文   时间:2014-11-29 07:07:04    阅读次数:154
登录不了路由器恢复办法
1,在本机上开服务器,然后用wget,把wr703XXX.bin下载到/tmp或者用winscp登陆,将原厂固件wr703XXX.bin上传到路由器的tmp目录下2,使用putty的ssh登陆路由器,用户名密码你自己知道(或第一次可用telnet登录)输入:mtd -r write /tmp/wr7...
分类:其他好文   时间:2014-11-29 07:06:21    阅读次数:156
Leetcode-Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you cli...
分类:其他好文   时间:2014-11-29 07:04:53    阅读次数:187
Leetcode-Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Solution:...
分类:其他好文   时间:2014-11-29 07:03:53    阅读次数:194
Leetcode Variant-Plus N
Given a non-negative number represented as an array of digits, plus N to the number.The digits are stored such that the most significant digit is at t...
分类:其他好文   时间:2014-11-29 07:05:00    阅读次数:185
Leetcode-Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at...
分类:其他好文   时间:2014-11-29 07:05:11    阅读次数:208
Leetcode-Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3...
分类:其他好文   时间:2014-11-29 07:06:01    阅读次数:191
HDU 4793 Collision(2013长沙区域赛现场赛C题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4793解题报告:在一个平面上有一个圆形medal,半径为Rm,圆心为(0,0),同时有一个圆形范围圆心也是(0,0),半径为R,R > Rm,现在向平面上投掷一枚硬币,硬币初始的圆心位置为(x,y),半径...
分类:其他好文   时间:2014-11-29 07:02:43    阅读次数:145
[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 ...
分类:其他好文   时间:2014-11-29 06:59:16    阅读次数:153
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 equa...
分类:其他好文   时间:2014-11-29 07:00:12    阅读次数:193
法国政府批3D游戏伤害儿童:任天堂躺枪
http://tuan.baidu.com/hot/query/45/%B1%B1%BE%A9%B3%AF%D1%F4%C7%F8%C0%B3%CC%AB%D5%D2%D0%A1%BD%E3%C9%CF%C3%C5%B7%FE%CE%F1%B5%E7%BB%B0%2F155%20-%200111%2...
分类:其他好文   时间:2014-11-29 06:55:51    阅读次数:136
Leetcode-Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类:其他好文   时间:2014-11-29 06:50:19    阅读次数:189
用持续集成工具Travis进行构建和部署
本文简单说明了如何使用持续集成工具Travis进行构建和部署的过程。
分类:其他好文   时间:2014-11-29 06:51:02    阅读次数:308
poj 3348 Cows 凸包 求多边形面积 计算几何 难度:0 Source:CCC207
CowsTime Limit:2000MSMemory Limit:65536KTotal Submissions:7038Accepted:3242DescriptionYour friend to the south is interested in building fences and tu...
分类:其他好文   时间:2014-11-29 06:47:32    阅读次数:194
Leetcode-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 / 3return [1,3,2]...
分类:其他好文   时间:2014-11-29 06:47:04    阅读次数:137
Leetcode-Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should return all...
分类:其他好文   时间:2014-11-29 06:47:54    阅读次数:165
Leetcode-Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes...
分类:其他好文   时间:2014-11-29 06:46:39    阅读次数:189
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!