冰点猎手

摘要： 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 singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) 阅读全文

摘要： Implement pow(x, n). class Solution {public: bool equal(double a, double b) { if(abs(a-b) >1); res *= res ; if(n&0x01 == 1) res *= x; return res; } double pow(double x, int n) { // Start typing your C/C++ solution below // DO NOT write... 阅读全文