二分查找

二分查找

#include <iostream>
using namespace std;

void FindNum(int a[], int data)
{
	int top = 0;
	int bottom = 10 - 1;
	int flag = -2;

	while (top <= bottom)
	{
		int mid = (top + bottom) / 2;
		if (data == a[mid])
		{
			cout << "查找到值为" << data << "的数" << endl;
			flag = 0;
			break;
		}
		else if(data>a[mid])
		{	
			top = mid + 1;
		}
		else
		{
			bottom = mid - 1;

		}
	}

	if (flag == -2)
	{
		cout << "未查找到该元素" << endl;
	}

}

int main()
{
	int a[10];
	for (int i = 0; i < 10; i++)
	{
		a[i] = i;
		cout << a[i] << " ";
	}
	cout << endl;
	int data;
	cin >> data;
	FindNum(a, data);
	system("pause");
	return 0;
}

反转链表

class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
        ListNode * pNode = pHead;
        ListNode * pLastNode = NULL;
        ListNode * pTemp = NULL;
        while(pNode!=NULL)
        {
            pTemp = pNode->next;
            pNode->next = pLastNode;
            pLastNode = pNode;
            pNode = pTemp;
        }
        return pLastNode;
    }
};