Circular linked list of integers
I'm not a big algorithms/data structures guy, but the only thing that caught my attention was the delete function. Is there a reason that delete uses data to identify the node, as opposed to just taking in the Node object you want to delete? It seems like that could get hairy if two nodes have the same data (which happens in main).

Besides that, there are a few comments I have in general about the code. Most of the following is fairly standard code format type stuff, but I think it's worth saying it as many times as possible.

Formatting

It's fairly minor, it helps to make sure there's an empty line between methods.

Also, I know some feel differently, but my preference about operators is that they have spaces on either side. data=datanew vs data = datanew.

Naming

In Java, the convention is that class names start with a capital letter, so circularLL should be CircularLL. Even better, it should really be something more descriptive like CircularLinkedList.

Besides that, names of methods, members, variables, etc should follow lowerCamelCase. So, datanew becomes dataNew, but I would personally call it newData.

In delete, avoid variable names like temp1 and previous1. With the number of variables and how they're named, you're starting to enter mental-juggling territory. What I mean by that is that as I read through the code, I have to keep reading back through the code to remember what a variable does because its name isn't descriptive enough.

Etc

I don't have too much else to say, but I would consider breaking this code out into two or three files. I would make a new class with main to separate the linked list from what's using it, and I might put Node in its own class.

Sorry I couldn't help out more with the efficiency/number of variables issue, but you don't seem to be doing anything too crazy, and like I said before, data structures and algorithms aren't my strong suit. Just thought I'd throw in my two cents.