leetcode_algorithms
yubo_725
大前端攻城狮
展开
-
344. Reverse String (Easy)
Reverse String Write a function that takes a string as input and returns the string reversed. Example: Given s = “hello”, return “olleh”. Subscribe to see which companies asked this question原创 2016-11-09 10:13:06 · 2822 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree (Easy)
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.题目即求二叉树的高度,层序遍历二叉树求解即可。Solution:J原创 2016-11-10 13:50:53 · 2857 阅读 · 0 评论 -
27. Remove Element (Easy)
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place with constant memo原创 2016-11-10 15:21:30 · 2865 阅读 · 0 评论 -
66. Plus One (Easy)
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.题目的意思是给定一个数,这个数以原创 2016-11-10 17:24:24 · 2908 阅读 · 0 评论 -
9. Palindrome Number (Easy)
Determine whether an integer is a palindrome. Do this without extra space.方法:将数字转化为数组,然后再判断是否回文。Solution:C++:#include<iostream>using namespace std;bool isPalindrome(int x) { if(x < 0) {原创 2016-11-10 22:20:50 · 2827 阅读 · 0 评论 -
234. Palindrome Linked List (Easy)
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?Solution:C:/** * Definition for singly-linked list. * struct ListNode { *原创 2016-11-12 11:37:19 · 2841 阅读 · 0 评论 -
141. Linked List Cycle (Easy)
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?Solution:C:/** * Definition for singly-linked list. * struct ListNode { * int原创 2016-11-12 21:49:07 · 2838 阅读 · 0 评论 -
19. Remove Nth Node From End of List (Easy)
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the en原创 2016-11-12 22:01:06 · 2812 阅读 · 0 评论 -
160. Intersection of Two Linked Lists (Easy)
Write a program to find the node at which the intersection of two singly linked lists beginsFor example, the following two linked lists:A: a1 → a2 ↘原创 2016-11-12 22:17:21 · 2770 阅读 · 0 评论 -
155. Min Stack (Easy)
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the原创 2016-11-16 18:15:48 · 2916 阅读 · 0 评论 -
20. Valid Parentheses (Easy)
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and “()[]{}” are all原创 2016-11-13 10:31:19 · 2869 阅读 · 0 评论 -
225. Implement Stack using Queues (Easy)
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() – Return原创 2016-11-13 11:15:18 · 2860 阅读 · 0 评论 -
232. Implement Queue using Stacks (Easy)
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.原创 2016-11-13 11:29:03 · 2914 阅读 · 0 评论 -
C语言对指针形参分配内存空间
今天在写C代码的时候遇到一个在函数内部为函数的指针形参分配内存空间的问题,代码如下:#include<stdio.h>#include<stdlib.h>void fun(int* p) { p = (int*)malloc(sizeof(int)); *p = 5;}int main(){ int* p = NULL; fun(p); if(p) {原创 2016-11-13 18:30:17 · 6743 阅读 · 1 评论 -
118. Pascal's Triangle (Easy)
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]]Solution:Java:public原创 2016-11-13 23:46:44 · 2982 阅读 · 0 评论 -
83. Remove Duplicates from Sorted List (Easy)
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->2->3.Solution:C:/** * Def原创 2016-11-10 13:34:36 · 2876 阅读 · 0 评论 -
226. Invert Binary Tree (Easy)
Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1Solution:C:/** * Definition for a binary tree node. * struct TreeN原创 2016-11-10 13:29:19 · 2847 阅读 · 0 评论 -
136. Single Number (Easy)
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 usi原创 2016-11-09 10:24:15 · 2776 阅读 · 0 评论 -
258. Add Digits (Easy)
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-11-09 14:26:19 · 2730 阅读 · 0 评论 -
283. Move Zeroes (Easy)
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 y原创 2016-11-09 14:37:31 · 2802 阅读 · 0 评论 -
237. Delete Node in a Linked List (Easy)
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 wit原创 2016-11-09 15:21:57 · 2750 阅读 · 0 评论 -
217. Contains Duplicate (Easy)
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 eleme原创 2016-11-09 16:02:02 · 2784 阅读 · 0 评论 -
242. Valid Anagram (Easy)
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 m原创 2016-11-10 09:03:27 · 2753 阅读 · 0 评论 -
169. Majority Element (Easy)
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 majority elemen原创 2016-11-10 09:20:46 · 2738 阅读 · 0 评论 -
21. Merge Two Sorted Lists (Easy)
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.Solution:C:/** * Definition for singly-linked list.原创 2016-11-10 09:44:59 · 2710 阅读 · 0 评论 -
191. Number of 1 Bits (Easy)
Write 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 representation 0原创 2016-11-10 09:55:17 · 2818 阅读 · 0 评论 -
70. Climbing Stairs (Easy)
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?爬楼梯问题,爬到第n层的可能是:从第n-1层爬到第n层原创 2016-11-10 10:10:49 · 2785 阅读 · 0 评论 -
100. Same Tree (Easy)
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value.Soluti原创 2016-11-10 10:16:22 · 2796 阅读 · 0 评论 -
171. Excel Sheet Column Number (Easy)
Related to question Excel Sheet Column Title Given a column title as appear in an Excel sheet, return its corresponding column number. For example:A -> 1B -> 2C -> 3...Z -> 26AA -> 27原创 2016-11-10 10:44:38 · 2792 阅读 · 0 评论 -
206. Reverse Linked List (Easy)
Reverse a singly linked list.Solution:C:/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */struct ListNode* reverseList(struct ListN原创 2016-11-10 11:23:38 · 2892 阅读 · 0 评论 -
202. Happy Number (Easy)
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原创 2016-11-10 11:36:51 · 2841 阅读 · 0 评论 -
144. Binary Tree Preorder Traversal (Medium)
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive solution is trivial, could y原创 2016-11-17 16:01:30 · 2936 阅读 · 0 评论