小小科学家的归来 by 王垠很多人来信关心我的现状,所以在写别的技术性文章之前,先说说我现在的情况吧.虽然自己追求的东西和经历都比较不同寻常,但是也许可以给奋斗中的人们一些慰藉和鼓励. 首先是超级好消息.几经周折,我得到了我想要的东西:异常强大而独立的思想.我成为了我想成为的人:曾经那个爱玩蚂蚁的“小小科学家”.他的灵魂回到了我身上.现在的我,每一天都充满了激情.脑子里总是有一些没法描述的,神奇的思想在萌发.它们让我感觉到无与伦比的美,让我的脸上浮现出笑容.它们让我从睡梦中蹦起,去试验.它们让我…
<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">完全没状态的新生归来赛,虐的很惨</span> A Hard Game And it's now going to be a hard game. N piles of coins are put down on the ground, where each piles co…
1. PL/SQL 转义 select order#, ……… from **** select col1 from A where col2 like '%\_keywors%' escape '\'; update A set url = 'homepage.aspx?code=32' || '&' || 'active=0' --& update A set url = 'homepage.aspx?code=32' || chr(38) || 'active=0' …
D: 399. Who Is Joyful 时间限制 3000 ms 内存限制 65536 KB 题目描述 There are several little buddies standing in a line. We say someone is a joyful little buddy, if there exists a little buddy whose height is smaller than him in the front of him and there exists a…
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You should not break any stick, but you can link them up, a…
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to…
Given a set of words (without duplicates), find all word squares you can build from them. A sequence of words forms a valid word square if the kth row and column read the exact same string, where 0 ≤ k < max(numRows, numColumns). For example, the wor…
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water. Given a list of stones' positions (in units) in sorted ascending ord…
