題目描述數(shù)組中有一個(gè)數(shù)字出現(xiàn)的次數(shù)超過數(shù)組長度的一半，請(qǐng)找出這個(gè)數(shù)字。例如輸入一個(gè)長度為9的數(shù)組{1,2,3,2,2,2,5,4,2}。由于數(shù)字...

Given a set of candidate numbers (C) (without duplicates) and a target n...

題目 Determine whether an integer is a palindrome. Do this without extra s...

自己在做個(gè)vue小demo的時(shí)候蒂教，想模擬從服務(wù)器獲取json數(shù)據(jù)的過程，一開始的想法是使用fetch直接獲取本地的json文件脆荷，無論是insta...

題目 Reverse digits of an integer.The input is assumed to be a 32-bit sign...

題目 Given a string s, find the longest palindromic substring in s. You ma...

題目 There are two sorted arrays nums1 and nums2 of size m and n respectiv...

題目 Given a string, find the length of the longest substring without repe...