LeetCode
EdwardAlbert
这个作者很懒,什么都没留下…
展开
-
258. Add Digits
Q: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原创 2016-11-27 10:18:05 · 276 阅读 · 1 评论 -
389. Find the Difference
Q:Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at a random position. Find the letter that原创 2016-11-29 20:43:47 · 257 阅读 · 0 评论 -
387. First Unique Character in a String
Q:Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. 问题:给定一个字符串,找出其中第一个仅出现一次的字符,若不存在返回-1。 Examples: s = "leetcode" return 0.原创 2016-11-27 11:24:11 · 340 阅读 · 0 评论 -
136. Single Number
Q:Given an array of integers, every element appears twice except for one. Find that single one. 问题:给定一个整数数组,其中除了一个元素仅出现一次,其他每个元素出现了两次。找到这个仅出现一次的数。 思路:用异或符“^” ,“^”可以理解为将二进制数的对应位相加且无进位,将数组中所有数依次亦或后,原创 2016-11-26 21:41:54 · 314 阅读 · 0 评论 -
283. Move Zeroes
Q:Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], after calling原创 2016-11-27 13:05:42 · 333 阅读 · 0 评论 -
416. Partition Equal Subset Sum
416. Partition Equal Subset Sum 题目:假设一个非空数组中仅包含正整数,判断是否可以将该数组分为两个子数组,使得两个子数组中元素的和相等 题解:这是一个0-1背包问题,假设原数组的和为sum,问题可以转化为:找到一个原数组的子集,使其子集内的元素之和等于sum/2。 方案一:递归算法 假设原数组为nums,其中有n个数,其和为sum,那么需要在这n个数中找出一个子集使...原创 2019-04-24 20:11:14 · 235 阅读 · 0 评论