Lin.B

2018年7月18日

摘要： Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文

posted @ 2018-07-18 19:46 Lin.B 阅读(136) 评论(0) 推荐(0) 编辑

[leetcode] Longest Increasing Subsequence

摘要： Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: T 阅读全文

posted @ 2018-07-18 16:42 Lin.B 阅读(163) 评论(0) 推荐(0) 编辑

2018年7月17日

[leetcode] Delete Operation for Two Strings

摘要： Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one cha 阅读全文

posted @ 2018-07-17 16:48 Lin.B 阅读(122) 评论(0) 推荐(0) 编辑

[leetcode] Minimum ASCII Delete Sum for Two Strings

摘要： Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Input: s1 = "sea", s2 = "eat" Output: 阅读全文

posted @ 2018-07-17 16:39 Lin.B 阅读(100) 评论(0) 推荐(0) 编辑

2018年7月16日

[leetcode] Palindromic Substrings

摘要： Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes are c 阅读全文

posted @ 2018-07-16 22:52 Lin.B 阅读(98) 评论(0) 推荐(0) 编辑

[leetcode] Student Attendance Record I

摘要： You are given a string representing an attendance record for a student. The record only contains the following three characters: 'A' : Absent. 'L' : L 阅读全文

posted @ 2018-07-16 20:45 Lin.B 阅读(98) 评论(0) 推荐(0) 编辑

[leetcode] Reverse String II

摘要： Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there ar 阅读全文

posted @ 2018-07-16 11:51 Lin.B 阅读(77) 评论(0) 推荐(0) 编辑

[leetcode] Diameter of Binary Tree

摘要： Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longestpath betwee 阅读全文

posted @ 2018-07-16 11:06 Lin.B 阅读(125) 评论(0) 推荐(0) 编辑

2018年7月15日

[leetcode] Climbing Stairs

摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

posted @ 2018-07-15 18:03 Lin.B 阅读(108) 评论(0) 推荐(0) 编辑

[leetcode] Range Sum Query - Immutable

摘要： Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Given nums = [-2, 0, 3, -5, 2, -1] sumR 阅读全文

posted @ 2018-07-15 17:32 Lin.B 阅读(95) 评论(0) 推荐(0) 编辑

公告