09 2017 档案

摘要:Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space fo 阅读全文
posted @ 2017-09-28 12:13 binryang 阅读(69) 评论(0) 推荐(0)
摘要:Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文
posted @ 2017-09-27 20:44 binryang 阅读(65) 评论(0) 推荐(0)
摘要:Given a linked list, remove the n th node from the end of list and return its head. For example, Note: Given n will always be valid. Try to do this in 阅读全文
posted @ 2017-09-26 09:04 binryang 阅读(87) 评论(0) 推荐(0)
摘要:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. java pub 阅读全文
posted @ 2017-09-22 16:18 binryang 阅读(82) 评论(0) 推荐(0)
摘要:Given a string containing just the characters , , , , and , determine if the input string is valid. The brackets must close in the correct order, and 阅读全文
posted @ 2017-09-22 15:19 binryang 阅读(89) 评论(0) 推荐(0)
摘要:Given an array S of n integers, are there elements a , b , c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum o 阅读全文
posted @ 2017-09-19 13:32 binryang 阅读(106) 评论(0) 推荐(0)
摘要:泛型类,就是具有一个或多个类型变量的类。 使用变量E表示集合的元素类型,K和V分别表示表的关键字与值的类型。T表示“任意类型”。 Pair 测试 结果 泛型方法,注意: 类型变量的限定 测试 结果 阅读全文
posted @ 2017-09-18 21:12 binryang 阅读(77) 评论(0) 推荐(0)
摘要:Write a function to find the longest common prefix string amongst an array of strings. 首先判断最小长度,然后就是遍历。记得内部循环后置零 java public String longestCommonPrefi 阅读全文
posted @ 2017-09-15 14:38 binryang 阅读(86) 评论(0) 推荐(0)
摘要:Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 自己写的代码第一次没有AC,超时。第二遍就莫名其妙通过了 附上相似代码 阅读全文
posted @ 2017-09-13 21:55 binryang 阅读(100) 评论(0) 推荐(0)
摘要:Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 阅读全文
posted @ 2017-09-12 22:22 binryang 阅读(71) 评论(0) 推荐(0)
摘要:Given n non negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo 阅读全文
posted @ 2017-09-11 22:28 binryang 阅读(94) 评论(0) 推荐(0)
摘要:连接数据库 利用QueryRunner进行操作 阅读全文
posted @ 2017-09-10 18:17 binryang 阅读(108) 评论(0) 推荐(0)
摘要:C3P0 config.xml 其中mvcapp在后面DButils中连接数据库使用 记得加入C3P0的jar包 假如C3P0出现No Suitable driver 解决方案 :在%JAVA_HOME%\jre\lib\ext下添加mysql connector java 5.1.12 bin.j 阅读全文
posted @ 2017-09-10 18:10 binryang 阅读(104) 评论(0) 推荐(0)