xuan_abc

2020年2月19日

摘要： Right shift a given string by n characters. Assumptions The given string is not null. n >= 0. Examples "abc", 4 -> "cab" public class Solution { publi 阅读全文

posted @ 2020-02-19 21:26 xuan_abc 阅读(271) 评论(0) 推荐(0)

[LC] 82. Remove Adjacent Repeated Characters IV

摘要： Repeatedly remove all adjacent, repeated characters in a given string from left to right. No adjacent characters should be identified in the final str 阅读全文

posted @ 2020-02-19 11:49 xuan_abc 阅读(146) 评论(0) 推荐(0)

[Algo] 280. Sort With 2 Stacks

摘要： Given an array that is initially stored in one stack, sort it with one additional stacks (total 2 stacks). After sorting the original stack should con 阅读全文

posted @ 2020-02-19 11:05 xuan_abc 阅读(189) 评论(0) 推荐(0)

[LC] 2. Add Two Numbers

摘要： You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single 阅读全文

posted @ 2020-02-19 09:57 xuan_abc 阅读(166) 评论(0) 推荐(0)

[Algo] 306. Check If Linked List Is Palindrome

摘要： Given a linked list, check whether it is a palindrome. Examples: Input: 1 -> 2 -> 3 -> 2 -> 1 -> null output: true. Input: 1 -> 2 -> 3 -> null output: 阅读全文

posted @ 2020-02-19 09:39 xuan_abc 阅读(137) 评论(0) 推荐(0)

2020年2月17日

[LC] 93. Restore IP Addresses

摘要： Given a string containing only digits, restore it by returning all possible valid IP address combinations. Example: Input: "25525511135" Output: ["255 阅读全文

posted @ 2020-02-17 12:43 xuan_abc 阅读(150) 评论(0) 推荐(0)

[LC] 131. Palindrome Partitioning

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example: I 阅读全文

posted @ 2020-02-17 11:47 xuan_abc 阅读(128) 评论(0) 推荐(0)

[LC] 216. Combination Sum III

摘要： Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be 阅读全文

posted @ 2020-02-17 10:53 xuan_abc 阅读(112) 评论(0) 推荐(0)

[LC] 90. Subsets II

摘要： Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution set must not conta 阅读全文

posted @ 2020-02-17 03:43 xuan_abc 阅读(96) 评论(0) 推荐(0)

2020年2月16日

[Algo] 73. Combinations Of Coins

摘要： Given a number of different denominations of coins (e.g., 1 cent, 5 cents, 10 cents, 25 cents), get all the possible ways to pay a target number of ce 阅读全文

posted @ 2020-02-16 11:43 xuan_abc 阅读(137) 评论(0) 推荐(0)

公告