算法
种菜的小朋友
日常开心、热爱写码
展开
-
几种排序的简要分析
几种排序的归纳总结(未完待续)选择排序:选择排序开始的时候,我们扫描整个列表,找到它的最小元素,然后和第一个元素交换,把最小的元素放到它应该放置的位置,同样,我们在剩下的元素中寻找最小的把它放到应处的位置。伪代码: for(int i=0;i<=n-2;i++){ min=i; for(int j=i+1;j<=n-1;j++){ if(原创 2016-10-23 18:57:40 · 334 阅读 · 0 评论 -
LeetCode 326. Power of Three Add to List QuestionEditorial
Total Accepted: 76257 Total Submissions: 194942 Difficulty: Easy Contributors: Admin Given an integer, write a function to determine if it is a power of three. class Solution { public:原创 2016-12-20 17:54:21 · 442 阅读 · 0 评论 -
LeetCode 70. 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?Note: Given n will be a positive inte原创 2017-01-16 09:47:37 · 223 阅读 · 0 评论 -
LeetCode 191. Number of 1 Bits
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 0000000000000原创 2017-01-16 09:58:22 · 200 阅读 · 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 since it in原创 2017-01-16 10:31:23 · 209 阅读 · 0 评论 -
LeetCode 501.Find Mode in Binary Search Tree
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.Assume a BST is defined as follows:The left subtree of a node contains onl原创 2017-04-08 19:21:07 · 380 阅读 · 0 评论 -
LeetCode 342.Power of Four
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without loops/re原创 2017-04-08 19:43:42 · 206 阅读 · 0 评论 -
LeetCode 345. Reverse Vowels of a String
Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.Note: The vowels原创 2017-04-09 11:53:24 · 228 阅读 · 0 评论 -
LeetCode 27. Remove Element
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 memory.The order原创 2017-04-09 12:07:29 · 225 阅读 · 0 评论 -
LeetCode 367. Valid Perfect Square
Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt.Example 1:Input: 16 Returns: True E原创 2017-04-09 12:19:29 · 226 阅读 · 0 评论 -
LeetCode 101. Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric:原创 2017-04-09 13:05:22 · 417 阅读 · 0 评论 -
LeetCode 118. 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]]class Solution {public: vector<原创 2017-04-22 01:24:30 · 295 阅读 · 0 评论 -
LeetCode 94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree [1,null,2,3], 1 \ 2 /原创 2017-07-28 19:19:08 · 290 阅读 · 0 评论 -
LeetCode 617. Merge Two Binary Trees
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree. T原创 2017-09-08 17:53:04 · 335 阅读 · 0 评论 -
LeetCode 434. Number of Segments in a String
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable characters.Exampl原创 2016-12-23 14:42:19 · 222 阅读 · 0 评论 -
LeetCode 202. 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原创 2016-12-22 17:36:45 · 381 阅读 · 0 评论 -
LeetCode 389. Find the Difference
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 was added in原创 2016-10-28 15:15:01 · 322 阅读 · 0 评论 -
LeetCode 104 Maximum Depth of Binary Tree
Maximum Depth of Binary Tree :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.题解:典型的回溯问题,就原创 2016-10-28 13:54:50 · 385 阅读 · 0 评论 -
LeetCode 371 Sum of Two Integers
Sum of Two Integers QuestionEditorial Solution My Submissions Total Accepted: 42633 Total Submissions: 82619 Difficulty: Easy Contributors: AdminCalculate the sum of two integers a and b, but y原创 2016-10-28 13:26:28 · 407 阅读 · 0 评论 -
LeetCode 226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1题解:就是做一下递归,把左子树全部都变成右子树。/** * Definition for a binary tree node. * struct Tree原创 2016-10-31 00:43:30 · 262 阅读 · 0 评论 -
LeetCode 283. Move Zeroes
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 your funct原创 2016-10-31 01:05:39 · 226 阅读 · 0 评论 -
LeetCode 404. Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.Example: 3 / \ 9 20 / \15 7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.题解:就是找叶子节点为左原创 2016-10-31 01:38:10 · 219 阅读 · 0 评论 -
动态规划相关知识笔记
动态规划动态规划是一种算法设计艺术。通常用来解决交叠的子问题构成的大问题。一般来说子问题都符合一定的递推关系,动态规划是将这些子问题的解存下来,这样从记录表中就可以得到原始解。首先我们来看一个简单的例子:1.币值最大化问题给定一排n个硬币,其面值均为正整数 c1,c2,c3,···cn,这些整数不一定两两不同。如何选择硬币使得在其原始位置互不相邻的条件下所选硬币金额最大。分两种情况讨论:设 F(原创 2016-11-12 13:43:01 · 485 阅读 · 0 评论 -
LeetCode 237. Delete Node in a Linked List
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 with value 3, t原创 2016-11-01 00:34:02 · 216 阅读 · 0 评论 -
LeetCode 349. Intersection of Two Arrays
Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].Note: - Each element in the result must be unique. - The result can b原创 2016-11-01 00:51:01 · 230 阅读 · 0 评论 -
LeetCode 100. Same Tree
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./** * Definition f原创 2016-11-01 01:22:00 · 234 阅读 · 0 评论 -
LeetCode 171. 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 -> 1B -> 2C -> 3...Z -> 26AA -> 27AB -> 28 题解:联想原创 2016-11-01 01:37:37 · 292 阅读 · 0 评论 -
LeetCode 387. First Unique Character in a String
Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1.s = "leetcode"return 0.s = "loveleetcode",return 2.class Solution {public: int原创 2016-11-01 02:23:05 · 221 阅读 · 0 评论 -
LeetCode 405. Convert a Number to Hexadecimal
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.Note:All letters in hexadecimal (a-f) must be in lowercase. The hexadecimal str原创 2016-12-17 21:15:07 · 380 阅读 · 0 评论 -
LeetCode 669. Trim a Binary Search Tree
Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so the result原创 2017-09-08 18:19:08 · 736 阅读 · 0 评论