码迷,mamicode.com
首页 >  
搜索关键字:ugly number    ( 27156个结果
leetcode——Two Sum 两数之和(AC)
Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, whe...
分类:其他好文   时间:2014-06-09 23:14:45    阅读次数:264
探究oracle clob字段是如何存储的
clob字段存储的是文本,如果存储少于4000个字节则clob字段会和记录存放在一起,如果存储超过4000个字节,则不会与记录存放在一起。值得注意的是,这里的4000个字节并不是等同于varchar2(4000),那相当于什么呢,请看下列实验: drop table test_clob purge; create table test_clob (   id number,   clob...
分类:数据库   时间:2014-06-08 17:00:32    阅读次数:258
LeetCode之Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum....
分类:其他好文   时间:2014-06-08 15:54:08    阅读次数:258
[LeetCode]Distinct Subsequences,解题报告
题目 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...
分类:其他好文   时间:2014-06-08 14:49:14    阅读次数:347
oracle 下操作blob字段是否会产生大量redo
操作blob字段是否会产生大量redo,答案是不会,下面来做一个实验,测试数据库版本是11.2.0.1.0: --创建一张表做测试之用 create table test_blob (   id number,   tupian blob ); import java.io.FileInputStream; import java.io.OutputStream; import ja...
分类:数据库   时间:2014-06-08 10:41:29    阅读次数:399
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 leaf node. 方法 使用DFS对树进行遍...
分类:其他好文   时间:2014-06-08 10:26:33    阅读次数:207
【oracle案例】ORA-01722
Oralce升级过程中,执行SQL> @?/rdbms/admin/catupgrd.sql脚本时, 遇到ORA-01722: invalid number报错, 导致报错的语句是 SELECT TO_NUMBER('DATA_VAULT_OPTION_ON') FROM v$option。 解决方法: 关闭Oracle Database Vault功能。...
分类:数据库   时间:2014-06-08 09:08:07    阅读次数:251
第六届湘潭市程序设计竞赛 -Happy Number
Happy Number Accepted : 110   Submit : 263 Time Limit : 1000 MS   Memory Limit : 65536 KB  Problem Description Recently, Mr. Xie learn the concept of happy numb...
分类:移动开发   时间:2014-06-08 05:44:33    阅读次数:264
projecteuler---->problem=23----Non-abundant sums
A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means th...
分类:其他好文   时间:2014-06-08 04:05:14    阅读次数:315
LeetCode——Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, whe...
分类:其他好文   时间:2014-06-08 02:12:04    阅读次数:216
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!