上一页 1 ··· 65 66 67 68 69 70 71 72 73 ··· 76 下一页
摘要: Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文
posted @ 2019-03-14 11:25 Schwifty 阅读(170) 评论(0) 推荐(0)
摘要: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文
posted @ 2019-03-14 09:34 Schwifty 阅读(155) 评论(0) 推荐(0)
摘要: Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文
posted @ 2019-03-14 04:04 Schwifty 阅读(182) 评论(0) 推荐(0)
摘要: 位运算: https://www.cnblogs.com/liaopeng/p/8436155.html 0>>1 = 0 (0<<1) + 1 = 1 0<<1 = 0 (0>>1) + 1 = 1 1&1 = 1, 0&1 = 0; Hashmap basic methods: https:// 阅读全文
posted @ 2019-03-14 01:28 Schwifty 阅读(247) 评论(0) 推荐(0)
摘要: Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = "ADOB 阅读全文
posted @ 2019-03-13 13:12 Schwifty 阅读(196) 评论(0) 推荐(0)
摘要: Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your al 阅读全文
posted @ 2019-03-13 11:36 Schwifty 阅读(193) 评论(0) 推荐(0)
摘要: Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runti 阅读全文
posted @ 2019-03-13 10:55 Schwifty 阅读(112) 评论(0) 推荐(0)
摘要: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it cost 阅读全文
posted @ 2019-03-13 10:22 Schwifty 阅读(151) 评论(0) 推荐(0)
摘要: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example: 思 阅读全文
posted @ 2019-03-12 13:28 Schwifty 阅读(123) 评论(0) 推荐(0)
摘要: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm should run in O(n) complexity. Examp 阅读全文
posted @ 2019-03-11 12:15 Schwifty 阅读(134) 评论(0) 推荐(0)
上一页 1 ··· 65 66 67 68 69 70 71 72 73 ··· 76 下一页