![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
字符串
Ber03
:)
展开
-
[LeetCode] 344. Reverse String
原题链接:https://leetcode.com/problems/reverse-string/1. 题目介绍Write a function that reverses a string. The input string is given as an array of characters char[].Do not allocate extra space for another ...原创 2019-03-20 12:03:39 · 117 阅读 · 0 评论 -
[LeetCode] 22. Generate Parentheses
原题链接原创 2019-07-17 22:09:24 · 135 阅读 · 0 评论 -
[LeetCode] 821. Shortest Distance to a Character
原题链接:https://leetcode.com/problems/shortest-distance-to-a-character/1. 题目介绍Given a string S and a character C, return an array of integers representing the shortest distance from the character C in ...原创 2019-05-17 17:45:48 · 176 阅读 · 0 评论 -
[LeetCode] 241. Different Ways to Add Parentheses
原题链接:https://leetcode.com/problems/different-ways-to-add-parentheses/原创 2019-05-20 11:47:34 · 177 阅读 · 0 评论 -
[LeetCode] 67. Add Binary
原题链接:class Solution { public String addBinary(String a, String b) { int ia = a.length()-1; int ib = b.length()-1; Stack<Integer> sta = StringToStack(a); ...原创 2019-05-01 15:34:05 · 94 阅读 · 0 评论 -
[LeetCode] 242. Valid Anagram
原题链接:https://leetcode.com/problems/valid-anagram/1. 题目介绍Given two strings s and t , write a function to determine if t is an anagram of s.给出两个字符串 s 和 t,写一个函数判断它们两个是不是相同字母异序词。Example 1:Input: s = ...原创 2019-05-01 18:32:54 · 117 阅读 · 0 评论 -
[LeetCode] 20. Valid Parentheses
原题链接:https://leetcode.com/problems/valid-parentheses/1. 题目介绍Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.An input string is ...原创 2019-05-01 17:11:49 · 116 阅读 · 0 评论 -
[LeetCode] 3. Longest Substring Without Repeating Characters
原题链接: https://leetcode.com/problems/longest-substring-without-repeating-characters/1. 题目介绍Given a string, find the length of the longest substring without repeating characters.给出1个字符串,寻找没有重复字母的最长子串...原创 2019-03-22 21:32:46 · 91 阅读 · 0 评论 -
[LeetCode] 28. Implement strStr()
原题链接:原创 2019-07-26 16:44:20 · 145 阅读 · 0 评论