- 博客(2)
- 收藏
- 关注
RSS订阅原创 leetcode解题报告258——Add Digits
题目： 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 dig
2015-08-18 17:55:01
538
原创 leetcode解题报告242——Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s.For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false.Note: You may assume the s
2015-08-03 21:24:58
422
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人