摘要：
Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrenc 阅读全文
posted @ 2019-08-25 00:08
Schwifty
阅读(136)
评论(0)
推荐(0)
摘要：
Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path. In a UNIX-style file system, a perio 阅读全文
posted @ 2019-08-24 23:02
Schwifty
阅读(164)
评论(0)
推荐(0)
摘要：
Given two strings s and t , write a function to determine if t is an anagram of s. Example 1: Example 2: Note:You may assume the string contains only 阅读全文
posted @ 2019-08-24 08:26
Schwifty
阅读(123)
评论(0)
推荐(0)
摘要：
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just two one's 阅读全文
posted @ 2019-08-24 02:55
Schwifty
阅读(153)
评论(0)
推荐(0)
摘要：
Validate if a given string can be interpreted as a decimal number. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true" 阅读全文
posted @ 2019-08-23 23:41
Schwifty
阅读(148)
评论(0)
推荐(0)
摘要：
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Example 2: 阅读全文
posted @ 2019-08-22 23:05
Schwifty
阅读(124)
评论(0)
推荐(0)
摘要：
Given a singly linked list, determine if it is a palindrome. Example 1: Example 2: Follow up:Could you do it in O(n) time and O(1) space? findmiddle返回 阅读全文
posted @ 2019-08-22 04:48
Schwifty
阅读(131)
评论(0)
推荐(0)
摘要：
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list's nodes, only nodes its 阅读全文
posted @ 2019-08-22 04:21
Schwifty
阅读(144)
评论(0)
推荐(0)
摘要：
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To represent a cycle in the given linked list, we use 阅读全文
posted @ 2019-08-22 02:09
Schwifty
阅读(148)
评论(0)
推荐(0)
摘要：
Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked list: 1->2->3->4->5, and n = 2. After removi 阅读全文
posted @ 2019-08-21 04:06
Schwifty
阅读(137)
评论(0)
推荐(0)
浙公网安备 33010602011771号