码迷,mamicode.com
首页 >  
搜索关键字:distinct    ( 3361个结果
LeetCode: Distinct Subsequences [115]
【题目】 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 none) of the characters without disturbing the relati...
分类:其他好文   时间:2014-06-29 07:27:17    阅读次数:210
Oracle EBS-SQL (BOM-5):检查有BOM但物料状态为NEW的物料.sql
select DISTINCT msi.segment1成品编码 ,msi.description 成品描述 ,msi.item_type 物料类型,msi.inventory_item_status_code 状态 ,msi.build_in_wip_flag 允许制造from INV.MTL_S...
分类:数据库   时间:2014-06-10 13:22:08    阅读次数:320
Oracle EBS-SQL (BOM-13):检查未定义库存分的物料类.sql
select distinct msi.segment1 编码 , msi.description 描述 , msi.primary_unit_of_measure 单位 , msi.inventory_item_status_code 状态 , flv.MEANING 物料类型 , catb1.....
分类:数据库   时间:2014-06-10 09:42:04    阅读次数:463
【leetcode】Climbing Stairs
You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb...
分类:其他好文   时间:2014-06-10 08:41:34    阅读次数:206
【leetcode】Climbing Stairs
问题: 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-06-10 08:19:31    阅读次数:194
Climbing Stairs
题目 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-06-10 07:38:21    阅读次数:171
Oracle EBS-SQL (SYS-5):sys_配置文件查询.sql
select distinct l.profile_option_name,v.profile_option_value,fu.user_nameform applsys.fnd_profile_option_values v, apps.fnd_profile_options_vl l,apps....
分类:数据库   时间:2014-06-09 17:38:39    阅读次数:317
Oracle EBS-SQL (SYS-8):职责定义明细.sql
SELECT DISTINCT fa.application_short_name 模块, b.responsibility_name 职责名称, fa.application_name 应用产品, b.responsibility_key 责任关键字, b.description 说明, D...
分类:数据库   时间:2014-06-09 17:01:37    阅读次数:294
[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
Subsets
题目 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. ...
分类:其他好文   时间:2014-06-08 04:01:05    阅读次数:240
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!