TrancyQing的博客

这几天接触比较多的就是LOV，最开始是写一个简单的LOV用来查询，慢慢地涉及到LOV之间，以及LOV与其他控件之间的联动。今天总结一下两种LOV联动的用法：1、LOV之间的联动：例子：省市联动。（真的是为了联动而联动，将就一下吧，知道基本上就是这么用就行）需求：创建一个搜索省份的LOV命名为LOV_PROVINCE，创建一个搜索城市的LOV命名为LOV_CITY，LOV_CITY中...

LOV的作用：通过自定义SQL语句或者调用mapper中的方法查询数据库，通过弹出窗口的形式提供数据选择的组件。例子：查询学生表，通过输入学生学号模糊查询学生信息。1、数据库中创建学生表并插入原始数据。2、创建LOV新建属性解释：代码：该LOV的唯一标识，在viewModel中调用的值。 ValueField：选中的查询记录代表的值。 TextField：选中的查询...

PalindromeTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 10048 Accepted: 3823DescriptionAndy the smart computer science student was attending an alg

Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10017    Accepted Submission(s): 3461Problem DescriptionHo

最长回文Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23719    Accepted Submission(s): 8673Problem Description给出一个只由小写英文字符a,b,c...y,

Seek the Name, Seek the FameTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20587Accepted: 10723DescriptionThe little cat is so famous, that ma

剪花布条Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21871    Accepted Submission(s): 13660Problem Description一块花布条，里面有些图案，另有一块直接

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 50920 Accepted: 21254DescriptionGiven two strings a and b we define a*b to be their conca

A SecretTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 1924    Accepted Submission(s): 704Problem DescriptionToday is the bir

Count the stringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11036    Accepted Submission(s): 5144Problem DescriptionIt is we

Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10080    Accepted Submission(s): 4313Problem DescriptionCC always

OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 42924 Accepted: 17251DescriptionThe French author Georges Perec (1936–1982) once wrote a book, L

Number SequenceTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29660    Accepted Submission(s): 12477Problem DescriptionGiven t

PeriodTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 18558 Accepted: 9019DescriptionFor each prefix of a given string S with N characters (each chara

CaoHaha's staffTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 337    Accepted Submission(s): 197Problem Description"You shall n

Hard challengeTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 812    Accepted Submission(s): 328Problem DescriptionThere are n

哇塞！只想说如果没有静下心，头脑不清晰的时候来看KMP真的很醉，昨天下午队伍确定分工后，我负责字符串，处理字符串怎么能不了解KMP算法呢，于是乎，从昨天下午开始到写博客的前两分钟，苦逼的我一直在啃KMP，让人心力交瘁啊，虽然之前数据结构课的时候有看到KMP但是因为老师没有讲，其实自己当时有试着去了解，但是那时候真的看得很吃亏，导致无果，这次重振旗鼓真的打算好好了解一番。在网上搜了很多资料，但是由于

1091 线段的重叠基准时间限制：1 秒 空间限制：131072 KB 分值: 5 难度：1级算法题 收藏 关注X轴上有N条线段，每条线段包括1个起点和终点。线段的重叠是这样来算的，[10 20]和[12 25]的重叠部分为[12 20]。给出N条线段的起点和终点，从中选出2条线段，这两条线段的重叠部分是最长的。输出这个最长的距离。如

货物运输Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 482    Accepted Submission(s): 210Problem Description公元2222年，l国发生了一场战争。

Journey with PigsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3300 Accepted: 1010DescriptionFarmer John has a pig farm near town A. He wants to vis