[leetcode - Bliend-75 ]3. Longest Substring Without Repeatin

Given a string s , find the length of the longest substring without repeating characters. 给定一个 string 找到该字串中没有重複的 sub-string 的最长长度。 Example : Input: s = abcabc
[leetcode - Bliend-75 ] 424. Longest Repeating Character Rep

You are given a string s and an integer k . You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the
[一天至少一题直到 ICPC 开赛 #013] 解题:Building an Aquarium(补12/22)

Building an Aquarium 题目连结 解题 应先具备以下能力 binary searchvertor知道从底部一层一层的看太慢了会 LTE ( MD我-2 ) 代名词 top 题目给并的最高处(可以用 1e10 或
[一天至少一题直到 ICPC 开赛 #014] 解题:Equal Candies(12/23)

Equal Candies 题目连结 首先要了解以下几个条件 1.不能把糖果换到其他盒 2.只能用减少(吃)的方式来达成平衡(每盒糖果数量相同) 所以我们能得出一个结论:
[leetcode - Bliend-75 ] 153. Find Minimum in Rotated Sorted

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [4,5,6,7,0,1,2] if it was rotated 4 times. [0,1,2,4,
[leetcode - Bliend-75 ] 33. Search in Rotated Sorted Array (

There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 = k nums.length) such th
[leetcode - Bliend-75 ] 21. Merge Two Sorted Lists (Easy)

You are given the heads of two sorted linked lists list1 and list2 . Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the
[一天至少一题直到 ICPC 开赛 #015] 解题:Compare T-Shirt Sizes(12/25)

Compare T-Shirt Sizes 题目连结 解题 要先了解以下状况 L 永远大于 M 或 S (不管加了几个X) M 永远大于 S (不管加了几个X) 尾号 相同 L : X 越多==越大 S : X 越多==越
[一天至少一题直到 ICPC 开赛 #016] 解题:Short Sort(12/24)

Short Sort 题目连结点此 抱歉,今天在写 12/25 的文章时才发现我昨天根本没有写XD 今天来补一下 题目意思 有 a b c 三张牌 只能用以下方法交换牌: 选两张牌,
[leetcode - Bliend-75 ] 206. Reverse Linked List (Easy)

Given the head of a singly linked list, reverse the list, and return the reversed list. 给一个 linked list 将他反转。 Example Input: 1 - 2 - 3 - 4 - 5 Output: 5 - 4 - 3 - 2 - 1 Coding /** * @pa
[leetcode - Bliend-75 ] 143. Reorder List (Medium)

You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln Reorder the list to be on the following form: L0 → Ln → L1 → Ln - 1 → L2 →