![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
clockwork、志
这个作者很懒,什么都没留下…
展开
-
两个有序数组的中间值(Median of Two Sorted Arrays)__By leetCode
Example nums1 = [1, 3] nums2 = [2] The median is 2.0 nums1 = [1, 2] nums2 = [3, 4] The median is (2 + 3)/2 = 2.5 求两个有序数组的中间值 One public double findMedianSortedArrays(int[] a, int...原创 2018-08-15 11:27:48 · 877 阅读 · 0 评论 -
两数之和问题(Two sum )__by leetCode
题目 Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1]. One public int[] twoSum(int[] old, int target){ for(int i=0; i<old.length; i++) { ...原创 2018-08-13 10:59:56 · 181 阅读 · 0 评论 -
两数之和 (Add Tow Numbers)__by leetCode
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retur...原创 2018-08-13 14:27:38 · 156 阅读 · 0 评论 -
字符串中查找最大连续不重复字符串(Longest Substring Without Repeating Characters)__By leetCode
Given a string, find the length of the longest substring without repeating characters. Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the answer ...原创 2018-08-13 16:05:59 · 1227 阅读 · 0 评论