【题目】
原文：
2.1 Write code to remove duplicates from an unsorted linked list.
FOLLOW UP
How would you solve this problem if a temporary buffer is not allowed?
译文：
从一个未排序的链表中移除重复的项
...
分类：
其他好文 时间：
2014-05-22 12:04:13
阅读次数：
196
Gallery和swithcer联合使用
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in complian...
分类：
其他好文 时间：
2014-05-22 11:19:05
阅读次数：
288
There are N children standing in a line. Each child is assigned a rating value.
You are giving candies to these children subjected to the following requirements:
Each child must have at least one candy.
Children with a higher rating get more candies than...
分类：
其他好文 时间：
2014-05-22 11:00:49
阅读次数：
285
【题目】
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no du...
分类：
其他好文 时间：
2014-05-22 10:43:12
阅读次数：
310
Description
You are given a string consisting of parentheses () and []. A string of this type is said to be correct:
(a)if it is the empty string(b)if A and B are correct, AB is correct,(c)...
分类：
其他好文 时间：
2014-05-22 09:53:27
阅读次数：
295
【题目】
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6]...
分类：
其他好文 时间：
2014-05-22 09:41:59
阅读次数：
195
<!--
Copyright 2011 Google Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the L...
分类：
移动开发 时间：
2014-05-22 08:41:44
阅读次数：
377
上联：no zuo no die why you try
下联：no try no high give me five
横批： let it go。
坑爹bug：
错误写法：
0 } ">true （最后一个大括号后多出一个空格，代码啥都不会输出）
正确写法： 0 }">true 正确写法 输出结果： true...
分类：
Web程序 时间：
2014-05-22 07:42:52
阅读次数：
355
问题
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes' values.
For example,
Given {1,2,3,4}, reorde...
分类：
其他好文 时间：
2014-05-22 07:04:46
阅读次数：
298
mysql 自定义存储过程和触发器
--存储过程示范
DROP PROCEDURE IF EXISTS PRO_TEST;
CREATE PROCEDURE PRO_TEST(IN NUM_IN INT,OUT NUM_OUT INT,INOUT NUM_INOUT)
BEGIN
//DO ANYTHING YOU WANT
END;
参数解释:
in : 就是输入参数，输...
分类：
数据库 时间：
2014-05-22 06:42:40
阅读次数：
345
