- 博客(2)
- 收藏
- 关注
原创 ACM Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3.
2015-04-14 18:04:57 639
转载 常用SQL语句(基础)
Student(S#,Sname,Sage,Ssex) 学生表 Course(C#,Cname,T#) 课程表 SC(S#,C#,score) 成绩表 Teacher(T#,Tname) 教师表 问题: 1、查询“001”课程比“002”课程成绩高的所有学生的学号; Java代码 select a.S# from (select s#,scor
2015-04-05 00:59:10 831
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人