摘要：
leetcode-1175-easy Return the number of permutations of 1 to n so that prime numbers are at prime indices (1-indexed.) (Recall that an integer is prim 阅读全文
posted @ 2022-11-26 20:31
iyiluo
阅读(29)
评论(0)
推荐(0)
摘要：
Unique Email Addresses Every valid email consists of a local name and a domain name, separated by the '@' sign. Besides lowercase letters, the email m 阅读全文
posted @ 2022-11-26 20:30
iyiluo
阅读(20)
评论(0)
推荐(0)
摘要：
Rotate String Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s. A shift on s consists of mo 阅读全文
posted @ 2022-11-26 20:30
iyiluo
阅读(20)
评论(0)
推荐(0)
摘要：
Replace Elements with Greatest Element on Right Side Given an array arr, replace every element in that array with the greatest element among the eleme 阅读全文
posted @ 2022-11-26 20:30
iyiluo
阅读(27)
评论(0)
推荐(0)
摘要：
Balanced Binary Tree Given a binary tree, determine if it is height-balanced. Example 1: Input: root = [3,9,20,null,null,15,7] Output: true Example 2: 阅读全文
posted @ 2022-11-26 20:29
iyiluo
阅读(21)
评论(0)
推荐(0)
摘要：
Count Binary Substrings Given a binary string s, return the number of non-empty substrings that have the same number of 0's and 1's, and all the 0's a 阅读全文
posted @ 2022-11-26 20:29
iyiluo
阅读(21)
评论(0)
推荐(0)
浙公网安备 33010602011771号