glj233的专栏

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 whet

Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Note:The input is assumed to be a 32-bit signed integer. Your function should return 0 when the rever

与之前的版本的区别是，不需要转序。代码：char* addBinary(char* a, char* b) { int n, m; for (n=0; *a; a++, n++) ; for (m=0; *b; b++, m++) ; int length; if(m>n) { length

Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".巧妙的算法：char* addBinary(char* a, char* b) { int n, m; for (n=0;

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 car" is not 

Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of th

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.empty(

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. * struct ListNode { * in

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

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 ↘

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?解题思路：    1 首先，找到该链表的中心。    2 接着，将链表的后半部分反序。    3 接着，将前半部分与后半部分进行比较

Determine whether an integer is a palindrome. Do this without extra space.