C++小程序练习
zhangla1220
这个作者很懒,什么都没留下…
展开
-
(练习)调整数组顺序 使奇数位于偶数前面
/***************************************** 调整数组顺序使奇数位于偶数前面(可扩展性) ***************************************/ #include using namespace std; bool Stard(int *x)//独立判断标准 可扩展 { if (*x & 0x1) { r原创 2014-07-21 19:36:38 · 456 阅读 · 0 评论 -
Remove Element - LeetCode
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原创 2014-11-03 15:36:48 · 378 阅读 · 0 评论 -
Maximum Depth of Binary Tree - LeetCode
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. /** * Definition for binary tree *原创 2014-11-02 14:15:50 · 433 阅读 · 0 评论 -
Merge Sorted Array-LeetCode
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 additional elements from B.原创 2014-11-02 17:41:06 · 494 阅读 · 1 评论 -
Remove Nth Node From End of List -LeetCode
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 end, the原创 2014-11-03 10:09:41 · 405 阅读 · 0 评论 -
Climbing Stairs - LeetCode
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 = 1时,S原创 2014-11-03 15:19:40 · 428 阅读 · 0 评论 -
Same Tree - LeetCode
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. 这道题感觉不难 做出来后每次原创 2014-11-02 16:50:41 · 448 阅读 · 0 评论 -
Remove Duplicates from Sorted Array-LeetCode
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with c原创 2014-11-03 14:32:58 · 375 阅读 · 0 评论 -
Remove Duplicates from Sorted List -LeetCode
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. /** * Definition for si原创 2014-11-03 14:16:35 · 369 阅读 · 0 评论 -
Valid Parentheses- LeetCode
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 vali原创 2014-11-03 10:33:28 · 419 阅读 · 0 评论 -
ZigZag Conversion-LeetCode
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I原创 2014-11-02 15:34:59 · 545 阅读 · 0 评论 -
Minimum Depth of Binary Tree - LeetCode
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. /** * Definition for binary tree *原创 2014-10-28 14:31:25 · 514 阅读 · 0 评论 -
Two Sum-LeetCode
LeetCode——Two Sum的两种解法原创 2014-10-20 20:29:14 · 481 阅读 · 0 评论 -
(练习)冒泡排序
/*冒泡排序*/ #include using namespace std; #define SIZE 10 void BubbleSort(int value[], int n) { int temp; int flag = 1;//改进:用于判断当没有可交换的数据对时,直接结束排序 int count = 0; for(int i = n-1; i > 0; i--原创 2014-07-21 19:35:26 · 635 阅读 · 0 评论 -
Pascal's Triangle - LeetCode
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原创 2014-10-27 18:43:01 · 469 阅读 · 0 评论 -
Pascal's Triangle II -LeetCode
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?原创 2014-10-27 18:28:55 · 356 阅读 · 0 评论 -
Path Sum - LeetCode
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原创 2014-10-28 11:25:48 · 428 阅读 · 0 评论 -
Balanced Binary Tree-LeetCode
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原创 2014-10-29 15:22:11 · 467 阅读 · 0 评论 -
String to Integer (atoi)-LeetCode
Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input case原创 2014-10-22 11:06:34 · 439 阅读 · 0 评论 -
Longest Common Prefix-LeetCode
Write a function to find the longest common prefix string amongst an array of strings.原创 2014-10-27 15:05:18 · 406 阅读 · 0 评论 -
Palindrome Number -LeetCode
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 th原创 2014-10-23 15:59:38 · 384 阅读 · 0 评论 -
Count and Say-LeetCode
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 "o原创 2014-10-22 15:04:32 · 432 阅读 · 0 评论 -
Symmetric Tree-LeetCode
struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {} }; bool issame(TreeNode *root1, TreeNode *root2) { if (root1 == NULL && ro原创 2014-10-22 16:25:31 · 431 阅读 · 0 评论 -
Binary Tree Level Order Traversal II-LeetCode
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},原创 2014-11-02 13:55:06 · 416 阅读 · 0 评论