![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
刷题
micky_Kiko
本科非计算机相关专业的准码农!
展开
-
leetcode算法——258:Add Digits(基于JAVA)
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one原创 2016-08-10 23:15:26 · 374 阅读 · 0 评论 -
leetcode算法——136. Single Number(基于JAVA)
Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra原创 2016-09-04 10:58:44 · 476 阅读 · 0 评论 -
leetcode算法——237. Delete Node in a Linked List(基于JAVA)
原题: Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with原创 2016-09-06 15:50:51 · 333 阅读 · 0 评论