OJ
文章平均质量分 57
neilooo
这个作者很懒,什么都没留下…
展开
-
[Leetcode] 4.Median of Two Sorted Arrays
题目 There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1:原创 2017-08-19 16:17:44 · 213 阅读 · 0 评论 -
[Leetcode] 22. Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ “((()))”, “(()())”,原创 2017-09-04 14:58:31 · 262 阅读 · 0 评论 -
[Leetcode] 44. Wildcard Matching
题目 Implement wildcard pattern matching with support for ‘?’ and ‘*’. ‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequence). The matching原创 2017-08-17 00:55:51 · 255 阅读 · 0 评论 -
[Leetcode] 10. Regular Expression Matching
题目 Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. The matching should cover the原创 2017-08-17 00:45:29 · 379 阅读 · 0 评论 -
[LeetCode] 219. Contains Duplicate II
判断是否存在两个相等的数,且|i - j| < k原创 2017-06-09 16:26:11 · 319 阅读 · 0 评论 -
[Leetcode] 32. Longest Valid Parentheses
题目 Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring. For “(()”, the longest valid parentheses substring is “()”原创 2017-08-17 14:58:37 · 254 阅读 · 0 评论 -
[笔试编程]2017.8.29腾讯模拟,满二叉排序树找最小子树
题目满二叉树排序树,高度k,节点数2^k-1,节点值1~2^k-1,给定3个数,求包含这3个数的最小子树的根节点。输入4个数组,第一个值为高度,后面3个值为目标数。例: 输入 4 10 15 13 输出 12思路 分治 1. 判断中间数是否包含在要找的数里面,包含则中间数是所求 2. 判断目标数是否全在左/右半,是则继续找左/右半。 3. 不全在左/右半,则中间数为所求。#inclu原创 2017-08-29 22:38:31 · 444 阅读 · 0 评论