上一页 1 2 3 4 5 6 7 8 ··· 28 下一页
摘要: Source You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that t 阅读全文
posted @ 2022-03-13 14:12 凌雨尘 阅读(38) 评论(0) 推荐(0) 编辑
摘要: Source Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preser 阅读全文
posted @ 2022-02-13 13:07 凌雨尘 阅读(38) 评论(0) 推荐(0) 编辑
摘要: Source Write a removeDuplicates() function which takes a list and deletes any duplicate nodes from the list. The list is not sorted. For example if th 阅读全文
posted @ 2022-01-09 12:04 凌雨尘 阅读(28) 评论(0) 推荐(0) 编辑
摘要: Source Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Example Given 1 阅读全文
posted @ 2021-12-05 13:54 凌雨尘 阅读(27) 评论(0) 推荐(0) 编辑
摘要: Source Given a sorted linked list, delete all duplicates such that each element appear only once. Example Given 1->1->2, return 1->2. Given 1->1->2->3 阅读全文
posted @ 2021-11-14 12:26 凌雨尘 阅读(33) 评论(0) 推荐(0) 编辑
摘要: Problem Description Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent differe 阅读全文
posted @ 2021-10-24 12:49 凌雨尘 阅读(61) 评论(0) 推荐(0) 编辑
摘要: Problem Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers. Some hints: Could negative integers be pali 阅读全文
posted @ 2021-10-10 14:49 凌雨尘 阅读(36) 评论(0) 推荐(0) 编辑
摘要: Source Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant dig 阅读全文
posted @ 2021-09-19 15:10 凌雨尘 阅读(267) 评论(0) 推荐(0) 编辑
摘要: Source Ugly number is a number that only have factors 3, 5 and 7. Design an algorithm to find the Kth ugly number. The first 5 ugly numbers are 3, 5, 阅读全文
posted @ 2021-09-12 10:28 凌雨尘 阅读(51) 评论(0) 推荐(0) 编辑
摘要: Source Count the number of k's between 0 and n. k can be 0 - 9. Example if n=12, k=1 in [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12], we have FIVE 1's ( 阅读全文
posted @ 2021-08-22 14:16 凌雨尘 阅读(32) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 28 下一页