1.使用case when方法（不建议使用）-代码如下复制代码SELECT COUNT(DISTINCT user_id) user_count, CASE WHEN create_time>1395046800 AND create_time1395050400 AND create_time13...
分类：
数据库 时间：
2014-10-09 00:59:57
阅读次数：
273
[leetccode]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 climb to the top?...
分类：
其他好文 时间：
2014-10-08 11:29:55
阅读次数：
193
原题地址：https://oj.leetcode.com/problems/distinct-subsequences/题意：Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subseq...
分类：
编程语言 时间：
2014-10-08 00:56:04
阅读次数：
262
select distinct StuNum,Name,Sex from Students
分类：
数据库 时间：
2014-10-05 13:36:08
阅读次数：
141
Additive equations
Time Limit: 10 Seconds Memory Limit: 32768 KB
We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer set, c...
分类：
其他好文 时间：
2014-10-04 19:29:37
阅读次数：
270
Given a set of distinct integers, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.
For example,
I...
分类：
其他好文 时间：
2014-10-03 22:24:55
阅读次数：
273
Problem Description
In this problem, you are given a string s and q queries.
For each query, you should answer that when all distinct substrings of string s were sorted lexicographically, which ...
分类：
其他好文 时间：
2014-10-03 16:56:54
阅读次数：
249
select * from personselect distinct name from personselect * from person where name='huangcongcong'select * from person where year>1991select * from p...
分类：
数据库 时间：
2014-10-02 20:22:53
阅读次数：
268
Chapter 17 Autorotation, Popover Controller, and Modal View Controllers1.There are two distinct orientations in iOS: device orientation and interface ...
分类：
其他好文 时间：
2014-10-02 17:50:23
阅读次数：
161
Given a string S and a string T, count the number of distinct subsequences of T in S.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be non...
分类：
其他好文 时间：
2014-10-02 16:03:39
阅读次数：
188
