上一页 1 ··· 53 54 55 56 57 58 59 60 61 ··· 76 下一页
摘要: 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 @ 2019-10-17 11:34 Schwifty 阅读(142) 评论(0) 推荐(0)
摘要: The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
posted @ 2019-10-17 10:25 Schwifty 阅读(127) 评论(0) 推荐(0)
摘要: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are ar 阅读全文
posted @ 2019-10-17 09:19 Schwifty 阅读(143) 评论(0) 推荐(0)
摘要: The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 阅读全文
posted @ 2019-10-17 01:56 Schwifty 阅读(154) 评论(0) 推荐(0)
摘要: Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' M 阅读全文
posted @ 2019-10-17 00:40 Schwifty 阅读(156) 评论(0) 推荐(0)
摘要: Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string which is for 阅读全文
posted @ 2019-10-16 05:30 Schwifty 阅读(193) 评论(0) 推荐(0)
摘要: A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given a non-empty strin 阅读全文
posted @ 2019-10-15 13:19 Schwifty 阅读(134) 评论(0) 推荐(0)
摘要: Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations permitt 阅读全文
posted @ 2019-10-15 10:30 Schwifty 阅读(132) 评论(0) 推荐(0)
摘要: Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Example 2: https://www.cnblogs.com/grandyang/p/4298664.html 阅读全文
posted @ 2019-10-12 01:19 Schwifty 阅读(142) 评论(0) 推荐(0)
摘要: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2019-10-11 11:38 Schwifty 阅读(164) 评论(0) 推荐(0)
上一页 1 ··· 53 54 55 56 57 58 59 60 61 ··· 76 下一页