上一页 1 ··· 24 25 26 27 28 29 30 31 32 ··· 37 下一页
摘要: Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list t 阅读全文
posted @ 2018-12-17 08:38 fatttcat 阅读(126) 评论(0) 推荐(0) 编辑
摘要: Given a target integer T, a non-negative integer K and an integer array A sorted in ascending order, find the K closest numbers to T in A. Assumptions 阅读全文
posted @ 2018-12-16 14:52 fatttcat 阅读(252) 评论(0) 推荐(0) 编辑
摘要: Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output “Fizz” instead of the numbe 阅读全文
posted @ 2018-12-16 08:50 fatttcat 阅读(166) 评论(0) 推荐(0) 编辑
摘要: Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at leas 阅读全文
posted @ 2018-12-16 08:34 fatttcat 阅读(160) 评论(0) 推荐(0) 编辑
摘要: Given a target integer T and an integer array A sorted in ascending order, find the index of the last occurrence of T in A or return -1 if there is no 阅读全文
posted @ 2018-12-16 06:07 fatttcat 阅读(162) 评论(0) 推荐(0) 编辑
摘要: Given a target integer T and an integer array A sorted in ascending order, find the index of the first occurrence of T in A or return -1 if there is n 阅读全文
posted @ 2018-12-16 06:03 fatttcat 阅读(189) 评论(0) 推荐(0) 编辑
摘要: Given a target integer T and an integer array A sorted in ascending order, find the index i in A such that A[i] is closest to T. Assumptions There can 阅读全文
posted @ 2018-12-15 18:19 fatttcat 阅读(108) 评论(0) 推荐(0) 编辑
摘要: Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If targetexists, t 阅读全文
posted @ 2018-12-15 17:44 fatttcat 阅读(152) 评论(0) 推荐(0) 编辑
摘要: Write a function that reverses a string. The input string is given as an array of characters char[]. Do not allocate extra space for another array, yo 阅读全文
posted @ 2018-12-15 15:43 fatttcat 阅读(105) 评论(0) 推荐(0) 编辑
摘要: Given a linked list, swap every two adjacent nodes and return its head. Example: Note: Your algorithm should use only constant extra space. You may no 阅读全文
posted @ 2018-12-15 10:18 fatttcat 阅读(152) 评论(0) 推荐(0) 编辑
上一页 1 ··· 24 25 26 27 28 29 30 31 32 ··· 37 下一页