leetcode
sanmao0816
这个作者很懒,什么都没留下…
展开
-
Compare Version Numbers 版本号比较 C语言实现
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and conta原创 2015-03-25 19:47:35 · 3169 阅读 · 0 评论 -
[leetcode]Count and Say (伯爵说 C语言实现)
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 of原创 2015-03-30 19:09:43 · 1683 阅读 · 0 评论 -
[leetcode]Reverse Linked List II (反转链表值 C语言实现)
Reverse Linked List II Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note: Given m, n原创 2015-04-18 22:38:43 · 1039 阅读 · 0 评论 -
[leetcode](Add Binary C语言实现)
Add Binary Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”. 题意:求两个二进制字符串相加,并把结果保存为二进制字符串。 解题思路:动态申请一个数组用于保存相加后的二进制字符串,两个二进制相加有两种可能: 1原创 2015-04-21 12:55:39 · 2036 阅读 · 0 评论 -
[leetcode](Gray Code 格雷码 C语言实现)
Gray Code The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequen原创 2015-04-19 18:22:14 · 2920 阅读 · 0 评论 -
[百度2016实习 在线笔试 编程第一题 度度熊 C语言]
最粗暴的实现算法,没有考虑优化问题。#include<stdio.h>#include <string.h>int function(char *str);int main(){ int num,temp,i; char s[100][10002]; scanf("%d",&num); temp = num;i = 0; while(num--){原创 2015-04-19 21:57:21 · 1299 阅读 · 0 评论 -
[leetcode](Remove Duplicates from Sorted List II C语言实现)
Remove Duplicates from Sorted List II Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2->3->3->4-原创 2015-04-19 23:06:36 · 816 阅读 · 0 评论 -
[leetcode](Remove Duplicates from Sorted Array II C语言实现)
Remove Duplicates from Sorted Array II Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice?For example, Given sorted array A = [1,1,1,2,2,3],Your function should return原创 2015-04-20 00:30:59 · 718 阅读 · 0 评论 -
[leetcode]Convert Sorted Array to Binary Search Tree (有序数组转化为二叉搜索树 C语言)
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 题意:给定一颗有序数组,求出二叉搜素树 解题思路:二叉搜索树满足的条件是:左子树<根节点<右子树 采用递归思路原创 2015-04-15 00:58:45 · 651 阅读 · 0 评论 -
[leetcode]Construct Binary Tree from Inorder and Postorder Traversal (利用中序遍历和后续遍历确定一颗二叉树)
Construct Binary Tree from Inorder and Postorder Traversal Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.原创 2015-04-15 00:50:54 · 730 阅读 · 0 评论 -
[leetcode]Construct Binary Tree from Preorder and Inorder Traversal(根据前序、中序遍历确定一棵二叉树 C语言)
Construct Binary Tree from Preorder and Inorder Traversal Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree. 题意:原创 2015-04-15 23:38:46 · 1058 阅读 · 0 评论 -
[leetcode]Validate Binary Search Tree (判断有效二叉搜索树 C语言实现)
Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less t原创 2015-04-17 00:57:35 · 1522 阅读 · 0 评论 -
Remove Linked List Elements [leetcode]
Remove Linked List ElementsRemove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5 题意: 删除给定的节点原创 2015-05-29 09:53:05 · 572 阅读 · 0 评论 -
[leetcode]Valid Sudoku(判断有效数独 C语言实现)
Valid Sudoku Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.A partially filled原创 2015-03-30 21:55:59 · 4210 阅读 · 0 评论 -
[leetcode]Length of Last Word (求最后一个单词的长度 C语言实现)
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原创 2015-03-30 09:58:59 · 1038 阅读 · 0 评论 -
[leetcode] Excel Sheet Column Title (excel表格的数字转字母表示格式) C语言实现
Given a positive integer, return its corresponding column title as appear in an Excel sheet. for example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB 题目的意思是:把1-26的数字转原创 2015-03-25 20:00:34 · 1347 阅读 · 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 ↘ c1原创 2015-03-25 21:59:16 · 557 阅读 · 0 评论 -
[leetcode]Min Stack (获取栈的最小元素C语言实现)
Min Stack 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()原创 2015-03-26 10:30:57 · 2662 阅读 · 0 评论 -
[leetcode]Valid Palindrome (判断回文数 C语言实现)
Valid Palindrome Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a原创 2015-03-26 15:37:22 · 1719 阅读 · 0 评论 -
[leetcode]Path Sum (分支求和 C语言)
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原创 2015-03-26 23:01:46 · 678 阅读 · 0 评论 -
[leetcode]Pascal's Triangle II (杨辉三角形求输出第k行的值)
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?原创 2015-03-26 16:56:08 · 1347 阅读 · 0 评论 -
[leetcode]Same Tree(判断两个二叉树是否相等 C语言实现)
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. 题意:比较两原创 2015-03-27 21:46:31 · 2925 阅读 · 1 评论 -
[leetcode]Symmetric Tree (对称树 C语言实现)
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原创 2015-03-27 20:54:04 · 778 阅读 · 0 评论 -
[leetcode]Maximum Depth of Binary Tree (求二叉树的最大深度 C语言)
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. 题意:给定一个二进制原创 2015-03-27 21:03:54 · 841 阅读 · 0 评论 -
[leetcode]Merge Sorted Array (两个有序数组的合并 C语言实现)
Merge Sorted Array Given two sorted integer arrays A and B, merge B into A as one sorted array.Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additiona原创 2015-03-28 16:12:57 · 832 阅读 · 0 评论 -
[leetcode]Remove Duplicates from Sorted List (删除有序节点的值重复的节点 C语言)
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-03-28 18:17:40 · 1199 阅读 · 0 评论 -
[leetcode]Climbing Stairs(爬楼梯 C语言)
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? 题意:你去爬楼梯,需要爬n个台阶,你原创 2015-03-28 19:02:08 · 3233 阅读 · 0 评论 -
Contains Duplicate [leetcode] 判断数组中是否有重复的元素
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原创 2015-05-28 20:07:28 · 1719 阅读 · 0 评论