摘要:
class Solution { public: double findMedianSortedArrays(vector& nums1, vector& nums2) { int m = nums1.size(), n = nums2.size(); return (findKth(nums1, nums2, (m + n + 1) / 2) + fin... 阅读全文
posted @ 2017-11-19 21:50
PirateLHX
阅读(103)
评论(0)
推荐(0)
摘要:
class Solution { public: int lengthOfLongestSubstring(string s) { string res=""; int maxlen=0; for(int i=0;ires.length())?maxlen:res.length(); } el... 阅读全文
posted @ 2017-11-19 21:29
PirateLHX
阅读(119)
评论(0)
推荐(0)
摘要:
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: int convert... 阅读全文
posted @ 2017-11-19 21:07
PirateLHX
阅读(92)
评论(0)
推荐(0)

浙公网安备 33010602011771号