Vancl_Wang Blog

1. 问题描述 Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at ...

1. 问题描述 该题目是Leetcode上一道Easy的题目，[原题描述如下][https://leetcode.com/problems/1-bit-and-2-bit-characters/]： We have two special characters. The first character can be represented by one bit 0. The second char...

1. 问题描述 该问题是leetcode上一道难易程度为easy的题目，原题如下： Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums. Formally, we can partition the...