ych_ding的专栏

问题描述：怎么样快速得到一个数 x 的相反数？x 是整数、x 是浮点数问题分析：

#include#includeusing namespace std;//#define DEBUGstatic const int MAX = 1001;static int seq[MAX];static int f[MAX];int main(){#ifdef DEBUG fstream cin("G:\\book\\algorithms\\acm\\Debug

问题描述：问题分析：借助额外空间示例代码：bool is_repating_character(char a[], int n){ int index[128] = { -1 }; for(int i = 0; i < n; i++) { if (index[a[i]] > 0) { return fal

int singleNumber(int A[], int n) { int result = 0; for (int i = 0; i < n; i++) { result = result ^ A[i]; } return result; }

int count_one_bruteforce(int x) { int n = sizeof(int) * 8; int c = 0; for (int i = 0; i < n; i++) { if ((x >> i ) & 1) { c++; } } return c; }

https://oj.leetcode.com/problems/maximum-product-subarray/点击打开链接

问题描述：double power(double x, int n)的计算， n 可以是正也可以是负。问题分析：注意计算效率，避免重复计算。伪代码：double power(double x, int n){ if (n == 0) return 1; if (n > 0) { double tmp = power(x, n >> 1);

#include /* not use global namespace */using namespace std; int conversion(int n, char s[], int d);int main() { int n, d; char result[32]; while (cin>>n>>d) cout<<conversion(n, r

问题描述：问题分析：伪代码：void insert_sort(a, n){ for (j = 1; j < n;j++) { cur = a[j]; for (i = j - 1; i >= 0 && cur < a[j]; a[j + 1] = a[j], i--); a[i] = cur; }}

问题描述：Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.https://oj.leetcode.com/problems/divide-two-integers/点击打开链接问题分析：实现整数除

/* 判断一个整数是不是2的整数幂 */ bool is_power_of_two(int x) { return !x & (x - 1); /* bug here, can you fix it?? */ }

bool hasCycle(ListNode *head) { if (!head) { return false; } ListNode *p = head->next; while (true) { if (!p) {

void serialize(node *root, ofstream &file) { if (!root) return; file dat << " "; serialize(root->l, file); serialize(root->r, file); } node * unserialize(ifstream &file) { node * r

问题描述：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/点击打开链接问题分析：

问题描述：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is

问题描述：https://oj.leetcode.com/problems/valid-sudoku/点击打开链接Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cell

问题描述：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 NA P L S

问题描述：https://oj.leetcode.com/problems/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"

问题描述：Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"Corner Cases:Did you consider the case where pa

问题描述：Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fi

问题描述：Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?https://oj.leetcode.com/problems/linked-list-cycle/问题分析：C语言代码：b

问题描述：https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/点击打开链接删除有序链表中的重复元素。Given a sorted linked list, delete all duplicates such that each element appear only once.

Minimum number of bracket reversals needed to make an expression balancedgiven an expression only containing ‘{’ and ‘}’, find a solution to determine the minimum number of bracket reversals needed to