leetcode
prettysky123
这个作者很懒,什么都没留下…
展开
-
LEETCODE-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 since it in原创 2015-09-01 21:10:40 · 282 阅读 · 0 评论 -
LEETCODE-Add Binary
leetcode Add Binary: Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”. #include<stdio.h>#include<iostream>#include<cstring>#define原创 2015-09-01 11:58:07 · 351 阅读 · 1 评论 -
LEETCODE-Power of Two
Power of Two Given an integer, write a function to determine if it is a power of two. One: 简单的利用while循环 判断输入的n在整除最多的2后是否为1;#include<iostream>using namespace std;bool isPowerOfTwo(int n) { wh原创 2015-09-08 20:32:03 · 360 阅读 · 0 评论 -
LEETCODE-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-09-03 17:02:21 · 216 阅读 · 0 评论 -
LEETCODE-Contains Duplicate
Contain 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 i原创 2015-09-10 21:44:58 · 257 阅读 · 0 评论 -
LEETCODE-Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up: Could you do it in O(n) time and O(1) space? 思路:将链表中的值赋值到一个整形数组中并对数组中的元素进行处理计算,判断是否为回文;/** * Definition for singly-linked lis原创 2015-09-26 17:14:59 · 204 阅读 · 0 评论 -
LEETCODE-Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, :分别讨论三种情况: 1、head指向为空; 2、删除的元素为第一个元素; 3、一般情况;Given linked list: 1->2->3->4->5, and n = 2. After remo原创 2015-09-25 09:38:19 · 208 阅读 · 0 评论 -
LEETCODE-Number of 1 Bits
Number of 1 BitsWrite a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representati原创 2015-09-11 20:37:33 · 352 阅读 · 0 评论 -
LEETCODE-Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: A: a1 → a2 ↘原创 2015-09-28 20:43:20 · 221 阅读 · 0 评论 -
LEETCODE-Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110原创 2015-10-18 11:21:50 · 237 阅读 · 0 评论 -
LEETCODE-Happy Number
Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of i原创 2015-09-30 17:49:12 · 224 阅读 · 0 评论 -
LEETCODE-Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers.Have you thought about this? Here are some good questions to ask before coding. Bonu原创 2015-10-18 13:26:13 · 225 阅读 · 0 评论 -
LEETCODE-Majority Element
Majority Element Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majori原创 2015-09-15 21:10:26 · 309 阅读 · 0 评论 -
LEETCODE-Remove Element
Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn’t matter what you leave beyond the new length. class So原创 2015-10-03 19:25:41 · 289 阅读 · 0 评论 -
LEETCODE-Plus One
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 digit is at the head of the list.class Solution {public:原创 2015-10-05 13:28:44 · 241 阅读 · 0 评论 -
LEETCODE-Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max How原创 2015-11-05 16:38:39 · 261 阅读 · 0 评论 -
LEETCODE-Remove Duplicates from Sorted List
Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->原创 2015-09-18 09:10:36 · 303 阅读 · 0 评论 -
LEETCODE--Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by原创 2015-11-07 20:20:49 · 267 阅读 · 0 评论 -
LEETCODE--Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between tw原创 2015-11-07 16:09:08 · 224 阅读 · 0 评论 -
LEETCODE-Climbing Stairs
Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 先进行列举找到规律; 1 ->原创 2015-09-18 21:25:16 · 293 阅读 · 0 评论 -
LEETCODE--Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3But the following原创 2015-11-08 11:47:52 · 296 阅读 · 0 评论 -
LEETCODE-Excel Sheet Column Number
Excel Sheet Column Number Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ...原创 2015-09-15 16:32:26 · 295 阅读 · 0 评论 -
LEETCODE-Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. 罗马数字: 罗马数字采用七个罗马字母作数字、即Ⅰ(1)、X(10)、C(100)、M(1000)、V(5)、L(50)、D(500) 1、相同的数字连写,所表示的数等于这些数原创 2015-09-19 21:00:22 · 233 阅读 · 0 评论 -
LEETCODE--Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For example: Given binary tree {3,9,20,#,#,15,7}, 3原创 2015-11-09 11:10:15 · 248 阅读 · 0 评论 -
LEETCODE-Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string.If the last word does not exist, return 0.Note: A word is defined as原创 2015-10-23 21:18:06 · 248 阅读 · 0 评论 -
LEETCODE--Pascal's Triangle
Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]Subscribe to see which comp原创 2015-11-09 20:44:49 · 249 阅读 · 0 评论 -
LEETCODE-Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additiona原创 2015-10-23 21:13:15 · 195 阅读 · 0 评论 -
LEETCODE-Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. Assume that the total area is n原创 2015-10-25 10:49:52 · 238 阅读 · 0 评论 -
LEETCODE-Implement Queue using Stacks
Implement the following operations of a queue using stacks. • push(x) – Push element x to the back of queue. • pop() – Removes the element from in front of queue. • peek() – Get the front element原创 2015-10-10 15:36:47 · 324 阅读 · 0 评论 -
LEETCODE-Implement Stack using Queues
Implement the following operations of a stack using queues. • push(x) – Push element x onto stack. • pop() – Removes the element on top of the stack. • top() – Get the top element. • empty() –原创 2015-10-10 17:23:02 · 230 阅读 · 0 评论 -
LEETCODE-Count and Say
The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, … 1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2, th原创 2015-10-25 20:55:18 · 222 阅读 · 0 评论 -
LEETCODE-Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity. 利用质因分解,将阶乘进行最终的分解; 对n!做质因数分解n!=2x*3y*5z*… 显然0的个数等于min(x,z),并且min(x,z)=原创 2015-10-11 11:47:41 · 219 阅读 · 0 评论 -
LEETCODE-Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 判断将第一个string赋值到一个model中,然后model与下一个string进行比较,找到longest common prefix,然后将比较结果重新赋值到model中在与下一个string变量进行比较,以此类推,找原创 2015-10-26 10:47:40 · 229 阅读 · 0 评论 -
LEETCODE-Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints: Could negative integers be palindromes? (ie, -1)If you are thinking of converting the inte原创 2015-10-12 16:29:38 · 262 阅读 · 0 评论 -
LEETCODE--Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree {3,9,20,#,#,15,7},3/ \ 9 20 / \ 15原创 2015-11-12 11:14:43 · 237 阅读 · 0 评论 -
LEETCODE-Implement strStr()
Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Update (2014-11-02): The signature of the function had been updated to re原创 2015-10-26 17:12:11 · 253 阅读 · 0 评论 -
LEETCODE-Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * struct ListNode原创 2015-09-23 19:36:19 · 261 阅读 · 0 评论 -
LEETCODE--Pascal's Triangle II
Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? Subscribe to see whic原创 2015-11-12 10:27:06 · 224 阅读 · 0 评论 -
LEETCODE--Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree and sum原创 2015-11-11 20:33:58 · 229 阅读 · 0 评论 -
LEETCODE-Remove Linked List Elements
在写之前,我想说的是; 大学里的数据结构教材中的link list与LEETCODE中的结构不一样; 数据结构这本教材中的链表是有头指针的即:第一个值为head->next; 在LEETCODE中链表是没有头指针的即:第一个值为head(head即指向第一个元素); //—————————————————————–// Remove all elements from a linked l原创 2015-09-23 19:28:57 · 319 阅读 · 0 评论