LISTAGG(measure_expr [, 'delimiter']) WITHIN GROUP (order_by_clause) [OVER query_partition_clause]SELECT DEPARTMENT_ID "Dept", HIRE_DATE "Date", LAS.....
分类：
其他好文 时间：
2014-12-21 16:27:26
阅读次数：
156
Integer to RomanGiven an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.逐区间做处理。解法一：非递归class Solution...
分类：
其他好文 时间：
2014-12-21 13:58:22
阅读次数：
136
Roman to IntegerGiven a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.从左到右遍历每个字符，并记录上个字符来处理双字符情况即可...
分类：
其他好文 时间：
2014-12-21 13:48:45
阅读次数：
191
Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [...
分类：
其他好文 时间：
2014-12-20 20:51:21
阅读次数：
386
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
class Solution {
public:
int romanToInt(string s) {
int weight[26];
...
分类：
其他好文 时间：
2014-12-19 14:30:53
阅读次数：
160
We have a circle of radius R and several line segments situated within the circumference of this circle. Let’s define acool pointto be a point on the ...
分类：
其他好文 时间：
2014-12-19 13:02:44
阅读次数：
236
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
class Solution {
public:
string intToRoman(int num) {
char symbol[] = {'I', ...
分类：
其他好文 时间：
2014-12-18 12:03:50
阅读次数：
162
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the...
分类：
其他好文 时间：
2014-12-17 17:44:05
阅读次数：
148
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the...
分类：
其他好文 时间：
2014-12-15 23:31:49
阅读次数：
214
标题：Roman to Integer通过率：34.1%难度：简单Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.这个题整体不是很难，就...
分类：
其他好文 时间：
2014-12-15 23:24:40
阅读次数：
211
