10 2019 档案

剑指Offer-1.二维数组中的查找(C++/Java)
摘要：题目： 在一个二维数组中（每个一维数组的长度相同），每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。 在一个二维数组中（每个一维数组的长度相同），每一行都按照从左到右递增的顺序排序，每一列都按照从上到 阅读全文
posted @ 2019-10-29 23:40 silentteller 阅读(322) 评论(0) 推荐(0)
LeetCode 676. Implement Magic Dictionary实现一个魔法字典 (C++/Java)
摘要：题目： Implement a magic directory with buildDict, and search methods. For the method buildDict, you'll be given a list of non-repetitive words to build 阅读全文
posted @ 2019-10-20 19:47 silentteller 阅读(295) 评论(0) 推荐(0)
LeetCode 300. Longest Increasing Subsequence最长上升子序列 (C++/Java)
摘要：题目： Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Note: There may be more than one LIS combination, 阅读全文
posted @ 2019-10-20 18:49 silentteller 阅读(330) 评论(0) 推荐(0)
LeetCode 674. Longest Continuous Increasing Subsequence最长连续递增序列 (C++/Java)
摘要：题目： Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray). Example 1: Example 2: Note: Length o 阅读全文
posted @ 2019-10-14 23:11 silentteller 阅读(228) 评论(0) 推荐(0)
LeetCode 63. Unique Paths II不同路径 II (C++/Java)
摘要：题目： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at a 阅读全文
posted @ 2019-10-11 22:15 silentteller 阅读(334) 评论(0) 推荐(0)
LeetCode 62. Unique Paths不同路径 (C++/Java)
摘要：题目： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at a 阅读全文
posted @ 2019-10-11 20:25 silentteller 阅读(260) 评论(0) 推荐(0)
LeetCode 268. Missing Number缺失数字 (C++/Java)
摘要：题目： Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Example 1: Example 2: Note:Y 阅读全文
posted @ 2019-10-11 19:19 silentteller 阅读(271) 评论(0) 推荐(0)