LeetCode
CloudShadow_
这个作者很懒,什么都没留下…
展开
-
[LeetCode]344. Reverse String
Write a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.class Solution {public: string reverseString(string s) { string re原创 2016-10-09 20:15:01 · 201 阅读 · 0 评论 -
[LeetCode]371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3.class Solution {public: int getSum(int a, int b) {原创 2016-10-09 20:44:17 · 200 阅读 · 0 评论 -
[LeetCode]389. Find the Difference
class Solution {public: char findTheDifference(string s, string t) { int i,l; int record[26]; for(i = 0;i<26;i++) { record[i] = 0; }原创 2016-10-09 20:57:05 · 266 阅读 · 0 评论 -
[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 on原创 2016-10-09 20:59:46 · 386 阅读 · 0 评论 -
[LeetCode]414. Third Maximum Number第三大的数
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).给一个非空的整形数组,返回这个数组中第三大的数。如果它原创 2016-12-06 15:12:21 · 481 阅读 · 0 评论 -
[leetcode]263. Ugly Number丑数
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly si原创 2016-12-08 11:10:28 · 304 阅读 · 0 评论 -
[leetcode]217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is原创 2016-12-08 15:16:26 · 305 阅读 · 0 评论