![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode-java
文章平均质量分 83
丫丫狸笫
A Girl
展开
-
Leetcode 561: Array Partition I
题目传送门: Leetcode 561. Array Partition I题目: Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai,原创 2017-05-03 17:36:38 · 507 阅读 · 0 评论 -
Leetcode 307: Range Sum Query - Mutable 之BIT
题目传送门: Leetcode 307.Range Sum Query - Mutable题目 Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. The update(i, val) function modifies nums b原创 2017-05-03 15:55:46 · 393 阅读 · 0 评论 -
Leetcode 10: Regular Expression Matching
Leetcode 10: Regular Expression MatchingImplement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element.转载 2017-08-16 23:25:34 · 312 阅读 · 0 评论 -
Leetcode 44:Wildcard Matching
Leetcode 44:Wildcard MatchingImplement wildcard pattern matching with support for ‘?’ and ‘*’. ‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequenc转载 2017-08-17 21:22:04 · 301 阅读 · 0 评论 -
Leetcode 560: Subarray Sum Equal k
Leetcode 560 Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.Example 1: Input:nums = [1,1,1], k = 2 Output: 2Note:转载 2017-08-16 21:59:26 · 295 阅读 · 0 评论 -
Leetcode 300 :Longest Increasing Sequence
Leetcode 300Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7转载 2017-08-16 22:31:09 · 405 阅读 · 0 评论 -
Leetcode 312: Burst Balloons
Leetcode 312: Burst Balloons Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst原创 2017-08-20 10:01:26 · 565 阅读 · 0 评论