![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
基础序列操作
文章平均质量分 51
chuandalishuo
这个作者很懒,什么都没留下…
展开
-
14. Longest Common Prefix
Java public class Solution { public String longestCommonPrefix(String[] strs) { if(strs.length==0) return ""; int count=0; boolean search=true; while(search){原创 2016-03-23 12:54:19 · 161 阅读 · 0 评论 -
16. 3Sum Closest
题目 Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have原创 2016-03-24 03:21:02 · 269 阅读 · 0 评论 -
165. Compare Version Numbers
题目: Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0. You may assume that the version strings are non-empty原创 2016-09-21 14:08:43 · 168 阅读 · 0 评论 -
274,275. H-Index I, II
Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According to the definition of h-index on Wikipedia: "A原创 2016-12-08 13:09:40 · 216 阅读 · 0 评论