2020年7月16日
Check if a given array contains duplicate elements within k distance from each other.
摘要： package _interview_question /** * Check if a given array contains duplicate elements within k distance from each other. * Given an unsorted array that 阅读全文
posted @ 2020-07-16 23:59 johnny_zhao 阅读(147) 评论(0) 推荐(0)
279. Perfect Squares
摘要： package LeetCode_279 import java.util.* import kotlin.collections.HashSet /** * 279. Perfect Squares * https://leetcode.com/problems/perfect-squares/d 阅读全文
posted @ 2020-07-16 23:00 johnny_zhao 阅读(101) 评论(0) 推荐(0)
fewest number of operations needed to get to 1
摘要： package _interview_question import java.util.* /** * The question is to find the fewest number of operations needed to get to 1. available operations: 阅读全文
posted @ 2020-07-16 01:01 johnny_zhao 阅读(118) 评论(0) 推荐(0)